DS-Binomials
DS-Binomials
Combinations
First Year Computer Engineering
Discrete Structures
Permutations & Combinations
Permutations : set of distinct objects / ordered arrangement of
objects.
S= {1,2,3} then (3,2,1) is a 3-permutation of S
(2,3) is a 2-permutation of S.
Permutations Combinations
• Arrangement • Selection
• Order is important • Order is not important
Binomial Coefficients
• The number of r-combinations for a set of n elements is also
called
Binomial Theorem
Binomial Theorem
(a+b) =
3 (a+b) (a+b) (a+b)
How many possible ways to pick an element per
(a+b) to obtain a term on the right-hand side.
a3 ab2 a2b b3
Binomial Theorem
n=100 r=4
n+r-1C = 100+4-1C4
r