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
Counting Triangles with a Given Perimeter
1428
16
Probability with a Modified Die
1193
35
Probability Based on Distance to a Side
1173
16
A Bracelet of Seven
1315
25
A Frog's Long-Run Habits
1417
9
Alphabetically-Arranged Permutations
1167
10
An Even, Unbroken Selection
1667
14
Average Path Sum
1488
14
Browse every Combinatorics problem →