1. Seating Arrangements (Permutations). Problem: 5 people at a round table — how many seating arrangements? Solution: (5-1)! = 24 (circular permutations). Why: order matters, people are distinct. Try the Real-World Scenarios tab above to explore this interactively.
2. Passwords (Permutations). Problem: how many 4-digit passwords using digits 0-9 without repetition? Solution: 10P4 = 10 × 9 × 8 × 7 = 5040. Why: order of digits matters for passwords.
3. Lottery (Combinations). Problem: pick 6 numbers from 49 in a lottery. Solution: 49C6 = 13,983,816. Why: order doesn't matter — {1,2,3,4,5,6} is the same as {6,5,4,3,2,1}.
4. Card Games (Combinations). Problem: how many 5-card poker hands from a 52-card deck? Solution: 52C5 = 2,598,960. Why: order of cards in your hand doesn't matter.
5. Race Rankings (Permutations). Problem: 8 runners — how many ways to award gold, silver, bronze? Solution: 8P3 = 8 × 7 × 6 = 336. Why: order matters — first, second, third are different.
6. Choosing a Team (Combinations). Problem: choose 3 people from 10 for a committee. Solution: 10C3 = 120. Why: the order on the committee doesn't matter.
7. Lock Combinations (Permutations). Problem: a 3-digit lock with digits 0-9, no repetition. Solution: 10P3 = 10 × 9 × 8 = 720. Why: order of digits matters for the lock, even though it's called a "combination" lock.