Choosing Without Order
Combinations arise by counting ordered selections and then removing the artificial order that does not matter to the outcome.
What you'll learn
- Define what makes two selections the same outcome before counting.
- Derive a combination count from ordered selections by proving that each group has r! orderings.
- Use combination counts inside multi-stage counting problems without relying on keywords.
Before you start
Loading guided lesson…