SOLUTION: Prove that C(n,0) = 1

Algebra.Com
Question 895493: Prove that C(n,0) = 1
Answer by Edwin McCravy(20063)   (Show Source): You can put this solution on YOUR website!
0! is defined as 1.

C(n,0) =  =  =  = 1

But the real proof is by common sense:

If you have n things, then the number of ways you can choose
to take 0 of them is 1 way, -- and that 1 way is to not take any!

Edwin




RELATED QUESTIONS

Prove that 2C(2n − 1,n) = C(2n,n) for all n >... (answered by greenestamps)
Let {{{N = N[1] + N[2]}}} , and {{{1 <= k <= N[1]}}} and {{{1 <= k <= N[2]}}}. Prove... (answered by robertb)
prove that:... (answered by venugopalramana)
prove that C(n , r) + C(n , r-1) = C(n+1 ,... (answered by ikleyn)
Prove that for n<0 (answered by robertb)
1.Prove that 3^n=Summation(r=0,n)2^rC(n,r) 2. Evaluate... (answered by Edwin McCravy)
Prove: C(n,0) - C(n,1) + C(n,2) - C(n,3) + ⋯ = 0 Using binomial distribution??... (answered by Edwin McCravy)
prove that... (answered by ikleyn)
Prove that nC( n-1 ) =... (answered by richard1234)