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
Permutations with Fixed Start
1172
21
Probability Bound for the Maximum of Two Dice
1333
6
Probability of a Specific Dice Outcome
1250
6
Probability of Getting a Pair in a Deck
1125
18
Probability of Getting Two Red Cards in a Deck
1153
14
Probability of Matching Letters
1583
8
Probability of Matching Words
1177
26
Probability Under a Normal Distribution
1167
11
Browse every Combinatorics problem →