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
Maomao’s Investigation
833
12
Regions Formed by Lines in a Plane
1500
8
Seating Around a Round Table
1333
5
A Dice Game with a Penalty Roll
1667
6
Counting Constrained 3D Lattice Paths
1500
2
Yumeko's Gamble
833
8
Palindromes from Limited Letters
1375
8
The Diamond Detector
1292
4
Browse every Combinatorics problem →