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
Domino Tiling
1500
10
Domino Tiling II
1700
14
Domino Tiling III
1633
8
Expected Number of Distinct Colors
1583
9
Expected Number of Distinct Colors When Picking Balls
1330
16
Expected Number of Draws to Get a Product
1333
6
Expected Value for a Biased Coin
1500
7
Full House in a Deck of Cards
1093
16
Browse every Combinatorics problem →