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
Average Pairwise Difference in a Set
1490
28
Counting Quadruples Satisfying a Sum Constraint
1590
18
Sun and Moon Bracelets
1685
20
A Snake on a 3x3 Grid
1677
15
Average Value Over All Permutations
1623
20
Probability the Median Lies in an Interval
1512
13
Probability of Choosing Consecutive Terms
1450
22
Octagon Obstacle
1552
18
Browse every Combinatorics problem →