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
Strings with Paired Letters
1375
0
Ways to Delete Letters to Spell a Word
1583
2
Books Between Bookends
1583
2
Numbers Avoiding Small Factors
1083
7
Rectangles Avoiding the Center Square
1250
6
Red and Green Candy Piles
1333
5
The Unimodal Permutation Count
1375
5
Domino Tiling V
1667
2
Browse every Combinatorics problem →