n>C>0
1
there is only one way to choose nothing from n!
n>C>1
n
when choosing 1 object from n objects, there are n possibilities to choose from
n>C>n-1
n
when choosing 1 less than n from n objects, there are n possible objects to leave out
n>C>n
1
to select n objects from n objects, you must select everything, hence 1!
Properties of
Pascal’s Triangle
3 answers
Briefly outline each
Symmetry of Combinations:
From the Triangle, n>C>r = n>C>n-r
Additive Property of Combinations:
In any subsequent row, an entry is the sum of the two entries on either side of it in the previous row.
n>C>r = n-1>C>r-1 + n-1>C>r
Total # of Subsets from n Objects:
(Including empty set and universal set itself): 2^n
(Including empty set but excluding universal set; proper subsets): 2^n-1
Binomial Theorem
(x+y)^n = (n>0).x^n.y^0 + (n>1).x^n-1.y^1 + (n>2).x^n-2.y^2 … (n>n).x^0.y^n
combinations are equal to numbers in nth row of pascal’s triangle
x begins power of n and decreases while y starts power of zero and increases
Determine all the coefficiens in (binomial expansion)
Chat: finding coefficients of binomial expansion question
Find the coefficient of one term in expression
Chat: Finding coefficient of one term in binonial expansion question