2005 AIME II Problem 1

Attempt Problem 1 of the 2005 AIME II below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2005 AIME II solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

1.

A game uses a deck of nn different cards, where nn is an integer and n≥6.n \ge 6. The number of possible sets of 66 cards that can be drawn from the deck is 66 times the number of possible sets of 33 cards that can be drawn. Find n.n.
Answer: 13
Concepts:combinationsfactorial
Small hint:
Write the ratio (n6)(n3)\frac{\binom{n}{6}}{\binom{n}{3}} in factorials; almost everything cancels
Big hint:
Solve (n−3)(n−4)(n−5)=720(n-3)(n-4)(n-5) = 720 by writing 720=10⋅9⋅8720 = 10 \cdot 9 \cdot 8
Solution:
The condition says (n6)=6(n3).\binom{n}{6} = 6\binom{n}{3}. Dividing the binomial coefficients, (n6)(n3)=(n−3)(n−4)(n−5)6⋅5⋅4=6, \begin{aligned} \frac{\binom{n}{6}}{\binom{n}{3}} &= \frac{(n-3)(n-4)(n-5)}{6 \cdot 5 \cdot 4} \\ &= 6, \end{aligned} so (n−3)(n−4)(n−5)=720(n-3)(n-4)(n-5) = 720 =10⋅9⋅8.= 10 \cdot 9 \cdot 8.
Since the product (n−3)(n−4)(n−5)(n-3)(n-4)(n-5) is increasing in n,n, the only solution is n−3=10,n - 3 = 10, that is, n=13.n = 13.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.