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
Coloring 10x10 Grid
1793
20
The Parity Party
1192
28
Normal Distribution
1208
17
Discrete Probability
1023
40
Arrangements with Separations
1202
19
Building a Starting Five
1202
14
Digit Sum I
1205
17
Digits That Sum to Forty-Three
1195
22
Browse every Combinatorics problem →