AoPSWiki
Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!

1983 AIME Problems/Problem 8

From AoPSWiki

Revision as of 16:04, 25 April 2008 by Azjps (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Problem

What is the largest 2-digit prime factor of the integer {200\choose 100}?

Solution

Expanding the binomial coefficient, we get {200 \choose 100}=\frac{200!}{100!100!}. Let the prime be p; then 10 \le p < 100. If p > 50, then the factor of p appears twice in the denominator. Thus, we need p to appear as a factor three times in the numerator, or 3p<200. The largest such prime is \boxed{061}, which is our answer.

See also

1983 AIME (ProblemsResources)
Preceded by
Problem 7
Followed by
Problem 9
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us