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
Maximum Roll with Three Dice
1500
6
Maximum Total Score in a Ranking System
1703
16
Maximum Words Given Five Letters
1173
19
Number of Ways to Write as a Product
1160
15
Optimal Expected Value in a Marble Game
1583
6
Ordered Sums of Three Integers
1200
32
Paths on a lattice avoiding a point
1162
18
Permutation with Position Constraint
1333
7
Browse every Combinatorics problem →