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
Balls in Bounded Boxes
1417
8
Coefficient Hunting
1493
15
Counting Boxes with Unique Flavor Combinations
1403
13
Counting Digit Sum
1250
6
Counting Rectangles in a Grid II
1283
18
Counting Subsets with Divisibility Constraint
1500
11
Different Dice Outcomes
1198
17
Diophantine Inequality
1500
9
Browse every Combinatorics problem →