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
Coins Along the Diagonals
1583
5
Counting Words with a Vowel-Consonant Split
1500
6
Maximum Reachable Position Pairs on a Grid
1667
1
Couples at a Round Table
1333
5
Is the coin really fair?
1167
3
Bishops on a Diagonal
1250
8
Exact variance of Pearson's chi-square statistic
1167
1
Estimating an Exponential Survival Probability
1500
1
Browse every Combinatorics problem →