Category
Combinatorics
Counting carefully, and knowing when not to count at all.
Combinatorics is about counting without listing. The hard part is rarely the arithmetic; it is finding the description of the set that makes it countable in the first place.
Expect arrangements and selections, the pigeonhole principle, inclusion–exclusion, recursions, and bijections. A surprising number of these are solved by counting the same thing twice and setting the two answers equal.
Latest problems
181 problems
A Parity Loop Game
1750
8
Counting Squares in a Grid
1370
16
Markers Shifting on a Number Line
1500
3
Probability One Roll Divides the Other
1250
7
Marbles Shared Among Friends
1500
5
Couples at a Square Table
1667
3
Winning a Game by a Lead
1250
8
Numbers Like the Year's Digits
1167
7
Browse every Combinatorics problem →