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
Rolling Without Decrease
1417
9
Selected Coefficient Sum in a Polynomial Expansion
1500
9
Smallest Circular Arrangement with Sum Constraint
1667
11
Smallest Permutation from a Digit-Sum Clue
1333
7
Spacing Out a Selection
1500
6
Strictly Increasing Digits Count
1167
10
Subsets with an Even Product
1417
7
Sum of Numbers with a Fixed Number of Set Bits
1417
7
Browse every Combinatorics problem →