AIME 1983 · 第 8 题
AIME 1983 — Problem 8
题目详情
Problem
What is the largest -digit prime factor of the integer ?
解析
Solution
Solution 1
Expanding the binomial coefficient, we get . Let the required prime be ; then . If , then the factor of appears twice in the denominator. Thus, we need to appear as a factor at least three times in the numerator, so . The largest such prime is , 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, is good for this solution (if you know your primes) because and both lie in the interval .
The reason for this is because if 2 copies of the prime we want to find are on the numerator and one copy on the denominator (AKA it contains and also ), 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 is left after cancellation).
~ (formatted shalomkeshet)
Solution 2: Full Thinking Process of Solution 1.5
We want the largest two‑digit prime factor of
Let be a two‑digit prime factor of this number. Any such that remains after cancellation must appear at least twice in the numerator, because one factor of in a multiple of in the numerator will cancel with itself in the denominator. Therefore, there must be at least two multiples of between and .
Write such a multiple as , where is a positive integer. Then
Since is two‑digit, . Dividing the inequality by gives
For , , which gives , impossible because is two‑digit.
For , , which gives , so
For , , which gives , so
Notice that for larger , the upper bound is smaller, so larger minimize the maximum possible value of .
Thus the possible range of that has at least two multiples in is the intersection
The largest prime in is .
Therefore the largest two‑digit prime factor of is .
Note: If was less than or equal to 50, then for , would not be in the range . But since we have found a prime greater than 50, and works.
~
Solution 3: Clarification of Solution 1
We know that
Since , there is at least factor of in each of the in the denominator. Thus there must be at least factors of in the numerator for to be a factor of . (Note that here we assume the minimum because as goes larger in value, the number of factors of in a number decreases,)
So basically, is the largest prime number such that
Since , the largest prime value for is
~ Nafer
Note
Similar to 2023 MATHCOUNTS State Sprint #25
Comment
which came first, 1985 or 2023?