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
Binomial Coefficient Value
730
31
Counting Splits
872
14
Diagonals of a Polygon III
818
23
Digit Sum Count
903
13
Point Inside a Triangle
1542
8
Round-Robin Match Count
833
12
Arranging distinct letters
643
97
Choosing the Committee
712
33
Browse every Combinatorics problem →