combinatorics
Counting pairs — AMC & AIME Problems
34 problems
Practice every real AMC 8, AMC 10, AMC 12, and AIME problem that uses Counting pairs — a combinatorics concept — each with a professionally curated solution, many with a video solution too, from LIVE by Po-Shen Loh. Browse all concepts or the full past-contest archive.
All problems are used with official legal permission of the Mathematical Association of America (MAA).
Filter by difficulty
These problems’ difficulty ratings come from real solve attempts on our platform. Tap a band or a contest to filter the list below, and tap a selected band again to include all difficulties. See the full difficulty guide.
800
1200
1600
2000
2400
2800
3200
AMC 10
AMC 12
AIME
- 1994 AIME Problem 6
- 1995 AIME Problem 8
- 1996 AIME Problem 3
- 1996 AIME Problem 12
- 1997 AIME Problem 10
- 1998 AIME Problem 2
- 2001 AIME I Problem 10
- 2001 AIME II Problem 10
- 2002 AIME I Problem 5
- 2003 AIME I Problem 3
- 2004 AIME II Problem 10
- 2010 AIME II Problem 3
- 2010 AIME II Problem 4
- 2013 AIME I Problem 15
- 2015 AIME II Problem 5
- 2018 AIME I Problem 9
- 2019 AIME I Problem 2
More combinatorics concepts
- Arrangements with restrictions
- Basic counting
- Bijection
- Burnside’s Lemma
- Catalan Number
- Circular arrangements
- Combinations
- Combinatorial game
- Complementary counting
- Counting integers in a range
- Counting intersections
- Counting regions
- Counting shapes in figures
- Derangements
- Double counting
- Fencepost counting
- Generating functions
- Graph theory
- Inclusion-exclusion
- Lattice paths
- Multiplication principle
- Multiset permutations
- Partitions and compositions
- Pascal’s Triangle
- Permutations
- Pigeonhole principle
- Recursive counting
- Stars and bars
- Subsets
- Tiling
- Tree diagram
- Vandermonde’s Convolution
- Venn Diagram