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
Counting Paths in a Grid
1000
10
Counting Rectangles in a Grid
1000
7
Dice Product Divisibility
1000
7
Letter Arrangement with Order Constraints
1000
8
Non-Attacking Coins on a Chessboard
1250
9
Ordered Triples with a Fixed Sum
1000
6
Shirts in a Drawer
1290
14
Subsets Containing an Odd Number
1000
6
Browse every Combinatorics problem →