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 Book Distribution
942
13
Counting Restricted 4-Digit Numbers
858
21
Dice Sum Divisible by Three
843
16
Integer Equation
875
15
Minimum Draws to Guarantee All Colors
858
20
One of Each Colour
833
12
Ordered Pair Count
833
11
Permutations of a Word
833
14
Browse every Combinatorics problem →