Quote:
|
Originally Posted by anandv
Not a very elegant way to answer !
But still you saved the day
Any more elegant answers please!
|
The number of ways of choosing k things from a collection of n things is n!/k!(n-k)!.
For example, the number of handshakes that occur when everybody in a group of 5 people shakes hands can be computed using n = 5 (five people) and k = 2 (2 people per handshake) in this formula. (So the answer is 5!/(2! 3!) = 10).
Suppose that there are 2 people and "everybody shakes hands with everybody else." Obviously there is only one handshake.
But what happens if we put n = 2 (2 people) and k = 2 (2 people per handshake) in the formula? We get 2! / (2! 0!).
This is 2/(2 x), where x is the value of 0!.
The fraction reduces to 1/x, which must equal 1 since there is only 1 handshake.
The only value of 0! that makes sense here is 0! = 1.
And so we can
elegently define 0! = 1.