โ Discrete Mathematics learning pathDiscrete Mathematics ยท Module 6 of 10
Counting
Permutations, combinations and the binomial theorem.
๐ Key ideas
- Sum rule: either-or choices add; product rule: sequential choices multiply.
- Permutations nPr = n!/(n - r)!: order matters.
- Combinations nCr = n!/(r!(n - r)!): order does not matter.
- Binomial theorem: (a + b)^n = sum of nCk a^(n - k) b^k.
- Arrangements with repeated letters divide by the factorials of the repeats.
๐ก Real-life example: Permutations are like seating guests in numbered chairs; combinations are like choosing which guests to invite.
PermutationOrdered arrangement
CombinationUnordered selection
Product ruleMultiply counts of sequential choices
Binomial coefficientnCr, number of ways to choose r of n