返回题库

AIME 1983 · 第 8 题

AIME 1983 — Problem 8

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

What is the largest 22-digit prime factor of the integer n=(200100)n = {200\choose 100}?

解析

Solution

Solution 1

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

Solution 1.5, half (desperate)

The only way a single prime number will be left out after all the cancelation will have to satisfy the condition that out of all the multiples of the prime number we want to find, 2 of the multiples will have to be between 100 and 200, 6161 is good for this solution (if you know your primes) because 61261 \cdot 2 and 61361 \cdot 3 both lie in the interval (100,200)(100, 200).

The reason for this is because if 2 copies of the prime pp we want to find are on the numerator and one copy on the denominator (AKA it contains p2p^2 and also 1p\dfrac{1}{p}), there will only be 1 copy of the prime we want to find when all the cancellation is made when reducing the original fraction (only pp is left after cancellation).

~ Michaellin16Michaellin16 (formatted shalomkeshet)

Solution 2: Full Thinking Process of Solution 1.5

We want the largest two‑digit prime factor of

(200100)=200199101100991.{200\choose100}=\frac{200\cdot199\cdot\ldots\cdot101}{100\cdot99\cdot\ldots\cdot1}. Let pp be a two‑digit prime factor of this number. Any such pp that remains after cancellation must appear at least twice in the numerator, because one factor of pp in a multiple of pp in the numerator will cancel with itself in the denominator. Therefore, there must be at least two multiples of pp between 101101 and 200200.

Write such a multiple as kpkp, where kk is a positive integer. Then

101kp200.101\le kp\le200. Since pp is two‑digit, 10p9910\le p\le99. Dividing the inequality by kk gives

101kp200k.\frac{101}{k}\le p\le\frac{200}{k}. For k=1k=1, 1011p2001\frac{101}{1}\le p\le\frac{200}{1}, which gives 101p200101\le p\le200, impossible because pp is two‑digit.

For k=2k=2, 1012p2002\frac{101}{2}\le p\le\frac{200}{2}, which gives 50.5p10050.5\le p\le100, so

51p99.51\le p\le99. For k=3k=3, 1013p2003\frac{101}{3}\le p\le\frac{200}{3}, which gives 33.67p66.6733.67\le p\le66.67, so

34p66.34\le p\le66. Notice that for larger kk, the upper bound is smaller, so larger kk minimize the maximum possible value of pp.

Thus the possible range of pp that has at least two multiples in [101,200][101,200] is the intersection

[51,99][34,66]=[51,66].[51,99]\cap[34,66]=[51,66]. The largest prime in [51,66][51,66] is 6161.

Therefore the largest two‑digit prime factor of (200100){200\choose100} is 61\boxed{61}.

Note: If pp was less than or equal to 50, then for k=2k=2, kpkp would not be in the range [101,200][101,200]. But since we have found a prime greater than 50, k=2k=2 and k=3k=3 works.

~ SS240102696SS240102696

Solution 3: Clarification of Solution 1

We know that

(200100)=200!100!100!{200\choose100}=\frac{200!}{100!100!} Since p<100p<100, there is at least 11 factor of pp in each of the 100!100! in the denominator. Thus there must be at least 33 factors of pp in the numerator 200!200! for pp to be a factor of n=200!100!100!n=\frac{200!}{100!100!}. (Note that here we assume the minimum because as pp goes larger in value, the number of factors of pp in a number decreases,)

So basically, pp is the largest prime number such that

200p>3\left \lfloor\frac{200}{p}\right \rfloor>3 Since p<2003=66.66...p<\frac{200}{3}=66.66..., the largest prime value for pp is p=61p=\boxed{61}

~ Nafer

Note

Similar to 2023 MATHCOUNTS State Sprint #25

Comment

which came first, 1985 or 2023?