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
Sum of Powers of Five
1383
20
Switching Balls
1333
11
Tennis Probability
1417
6
Triangle Formation Probability
1167
8
Vowels United
1167
7
Browse every Combinatorics problem →