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
Jumping Frog on Vertical Side
1500
9
Keeping Rivals Apart
1333
6
Keeping the Vowels Apart
1583
7
Lattice Paths in a Grid with Constraint
1417
6
Lattice Points Inside an Ellipse
1167
11
Lexicographic Permutations
1417
6
Maximizing Variance with Fixed Mean and Mode
1180
16
Maximum Intersection Points
1250
6
Browse every Combinatorics problem →