SOLUTION: Combinations: C(n,1)=
Algebra.Com
Question 342059: Combinations: C(n,1)=
Answer by jim_thompson5910(35256) (Show Source): You can put this solution on YOUR website!
C(n,1)=
So C(n, 1) = n. Ie there are 'n' ways to order select 1 item from a pool of 'n' items (where order doesn't matter)
If you need more help, email me at jim_thompson5910@hotmail.com
Also, feel free to check out my tutoring website
Jim
RELATED QUESTIONS
Let {{{N = N[1] + N[2]}}} , and {{{1 <= k <= N[1]}}} and {{{1 <= k <= N[2]}}}.
Prove... (answered by robertb)
Using the definition of permutations and combinations, solve for n in the following... (answered by ikleyn)
The number of combinations of n items taken 2 together is 6 larger than the number of... (answered by greenestamps,ikleyn)
prove that C(n , r) + C(n , r-1) = C(n+1 ,... (answered by ikleyn)
simplify (n-1)C(r-1) +... (answered by richard1234)
Proof that ncr=(n/n-r)(n-1 c r)
Proof that n(n-1 c r) = (r+1) (n c... (answered by math_helper)
Show that:
n C r = [(n-2) C r] + 2[(n-2) C (r-1)] + [(n-2) C (r-2)]
(answered by Edwin McCravy)
prove that:... (answered by venugopalramana)
Show that r(nCr) = n[(n-1)C(r-1)] (answered by Edwin McCravy)