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
Words Containing at Least One R
1000
5
Counting Digit Strings with Position Constraints
1708
13
Digits from a Lexicographic Permutation Sequence
1583
11
Letter Arrangements
1000
7
Maximizing a Triangle Side Product
917
8
Permutations with Vowels in Order
917
10
Stopping on the Third Draw
1172
21
Triangle Third Side Count
917
9
Browse every Combinatorics problem →