The proof that 0! = 1 depends on your definition of "!".
If your definition is n! is the product of the nonnegative integers less than or equal to n, while your definition of "product" incorporates the convention "an empty product equals 1" then the proof of 0!=1 is a two line proof applying the two lines of the definition, one by one.
https://en.wikipedia.org/wiki/Factorial
If you prefer a different definition then you will have to find a different proof, of course.
@Carlo: There are no permutations of a set containing no objects so the definition "number of permutations" is not a good definition. (A permutation is a function from the set to itself which is a bijection).
@Vasily: the "fact" that N! = Gamma(N+1) depends on what is the definition of the gamma function, and what is the definition of "factorial". So the relation you mention, though true, is not the proof.
@Bui: you are right too, but the fact you mention is also a consequence of the definition of n! (whatever that is), not a proof. Before we can give a proof of 0! = 1 we have to state the definition of "!". Depending on the definition, the proof might be different. There are several different conventional definitions. They are all equivalent, of course, so there is no conflict.
No Proof can be given because it is defined like that. The special case is defined to have value, consistent with the combinatorial interpretation of there being exactly one way to arrange zero objects (i.e., there is a single permutation of zero elements, namely the empty set).
n! = 1*2*3*..............(n-1)*n, therefore 1!= 1..................................................(1) also n! = n*(n-1)! and for n = 1 1! = 1*0! ..............................................(2) from (1) and (2) 0! = 1
We know number of combinations of ‘r’ objects chosen from ‘n’ objects is nCr=n! /(r!(n-r)!) Also we know that number of combinations of ‘n’ objects chosen from ‘n’ objects is ‘1’ so