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
Divisible Palindrome Count
1083
12
Lexicographic Order III
1083
12
Permutations with Constraint II
1120
15
Permutations with Divisibility Constraint
1167
10
Probability a Dice Product Is Divisible by a Number
1118
15
Probability of a Positive Score in a Coin Game
1480
18
Probability of Picking Matching Colors
1173
20
Counting Odd-Digit Multiples
1000
14
Browse every Combinatorics problem →