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 Set Elements
692
50
Median of a Set
615
139
Non-empty Subsets
675
54
Ten Seats Around a Table
713
40
Probability of 4 dices
1643
19
Counting Terms in a Symmetric Expansion
1573
19
Decagon Adjacency Challenge
1500
10
Number of grid 11x11
1848
24
Browse every Combinatorics problem →