Explanation
Welcome to The Counting Carnival
How many passwords, how many teams, how many ways to seat a family at dinner? At the Counting Carnival, you'll count without listing, decide whether order matters, and then use the same counting to expand any power of a bracket.
AND
The fundamental principle: if you do one thing and then another, multiply the ways. If you do one thing or another, add them.
AND → multiply · OR → add
Arrangements (order matters)
When order matters, it's a permutation. Five people in a row: five choices for the first seat, four for the next, and so on.
Five factorial, a hundred and twenty.
Arrangements (order matters): ⁿPᵣ = n!/(n − r)! · n objects in a row: n!
Selections (order doesn't matter)
When you only choose, and order doesn't matter, it's a combination. Choosing three from ten: ten C three, a hundred and twenty.
Choosing three to keep is the same as choosing seven to drop.
Selections (order doesn't matter): ⁿCᵣ = n!/[r!(n − r)!] · ⁿCᵣ = ⁿCₙ₋ᵣ
Identical objects
If some objects are identical, swapping them makes no new arrangement. Divide by the factorial of each repeated group.
APPLE has two P's: five factorial over two factorial, sixty.
Identical objects: n!/(p! q! …)
Circular
Round a table, rotations look the same, so fix one person and arrange the rest: n minus one factorial. A necklace can also be flipped, so halve it.
Circular: (n − 1)! · necklace or garland (flip allowed): (n − 1)!/2
Together
To keep two people together, glue them into one block, arrange, then multiply by their two internal orders. For 'never together', take the total and subtract the 'together' count.
Together: glue them into one block × internal arrangements · never together: total − together
Worked example
A committee of 3 men and 2 women from 5 men and 4 women: ⁵C₃ × ⁴C₂ = 10 × 6 = 60.