Lesson 16 min· Section 1 of 4
The straight-up lesson, built for the exam.
Permutation & Combination
Formula sheet
Everything for this chapter, in one place.
The two tools
| Order matters — arrangements | |
| Order does not — selections | |
| Symmetry | |
| Edges | |
| Link |
When some objects are identical
| Arranging with repeats | |
| Round a circle | |
| Any subset of distinct things |
Identical objects into distinct boxes — stars and bars
| identical into boxes, empties allowed | |
| Each box at least one | |
| Each box at least | hand out the minimums first, then use the "empties allowed" form |
| An upper limit as well | count without it, then subtract the violations |
Counting the complement
| "At least one …" | total "none" |
| "At least one digit repeated" | total "all digits distinct" |
| Onto functions, elements to |
Numbers from digits
| Sum of all numbers from distinct digits, each used once | |
| Each digit appears in each place | times |
| Leading zero | count freely, then subtract the arrangements that start with 0 |
| Divisible by 3 | the digit sum must be divisible by 3 |
| Divisible by 6 | digit sum divisible by 3 and last digit even |
Paths and pairs
| Lattice paths, right and up | |
| Via an intermediate point | multiply the two legs |
| Handshakes among | |
| Pigeonhole | with items in boxes some box holds at least |