This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice proof :) (+1)
n ! is the number of ways we can arrange n objects. If we have 0 objects we can only arrange it in one way that is to put 0 object. This may seem a bit philosophical and eccentric :P. An example:- How can you arrange 3 pens A,B,C? The answer is 6 because we can arrange them as ABC, ACB, BAC, BCA, CAB, CBA. How many ways can we arrange 2 pens A and B? The answer is 4:- AB and BA. How can ways can we arange 1 pen A? Only in 1 way that is A. Now, how many ways can you arrange 0 pens. There is one way! Dont place anything at all. That is the way of arranging 0 pens. So, we get 0 ! = 1 .
Your solution and @Prince Loomba solution are the same.
Log in to reply
Nope a bit different, I explained with reference to arranging atoms. It was more of reasoning solution while Prince Loomba's solution was mathematical proof :P
Log in to reply
you related the same thing with pens
Log in to reply
@Ayush G Rai – Thats the point, my solution was more of reasoning style. ;) get it?
Another proof is using nC0 that is ( 0 n ) . nC0=1 and it is equal to n ! 0 ! n ! . From here we can conclude 0! Is 1.
Problem Loading...
Note Loading...
Set Loading...
Suppose we take a to be some whole number.
a ! = a + 1 ( a + 1 ) !
So, 0 ! = 0 + 1 ( 0 + 1 ) ! = 1 .