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
6-Digit Numbers with a Given Digit Product
1207
15
Room of Extroverts
1273
12
Champernowne constant digits
1187
21
Counting Valid Grid Fillings
1667
13
Domino Tiling IV
1533
15
Counting Digit Patterns with a Product Bound
1648
16
Conditional Probability of Matching Colors
1517
16
Probability of a Product Divisible by a Number
1343
20
Browse every Combinatorics problem →