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 Long Chords on a Circle
1583
7
Maximum Guaranteed Boyfriends in a Ratio Constraint
1708
3
Probability of Independent Experiments
1308
15
Coloring unit squares
1917
10
Extremal colors integers
1750
9
Probability a Number Exceeds a Sum
1502
17
The Number of Good Set
1907
17
Rock Paper Scissors Tournament
605
117
Browse every Combinatorics problem →