Art of Problem Solving
During AMC 10A/12A testing, the AoPS Wiki is in read-only mode and no edits can be made.

1983 AIME Problems/Problem 8: Difference between revisions

Nafer (talk | contribs)
Nafer (talk | contribs)
Line 8: Line 8:


== Solution 2: Clarification of Solution 1 ==
== Solution 2: Clarification of Solution 1 ==
First notice that
<math></math>


== See Also ==
== See Also ==

Revision as of 10:20, 14 August 2019

Problem

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

Solution

Expanding the binomial coefficient, we get ${200 \choose 100}=\frac{200!}{100!100!}$. Let the required 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 at least three times in the numerator, so $3p<200$. The largest such prime is $\boxed{061}$, which is our answer.


Solution 2: Clarification of Solution 1

First notice that $$ (Error compiling LaTeX. Unknown error_msg)

See Also

1983 AIME (ProblemsAnswer KeyResources)
Preceded by
Problem 7
Followed by
Problem 9
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions