Difference between revisions of "1983 AIME Problems/Problem 8"
m |
Shalomkeshet (talk | contribs) m (→Solution 1.5, half (desperate)) |
||
(6 intermediate revisions by 3 users not shown) | |||
Line 8: | Line 8: | ||
Expanding the [[combination|binomial coefficient]], we get <math>{200 \choose 100}=\frac{200!}{100!100!}</math>. Let the required prime be <math>p</math>; then <math>10 \le p < 100</math>. If <math>p > 50</math>, then the factor of <math>p</math> appears twice in the denominator. Thus, we need <math>p</math> to appear as a factor at least three times in the numerator, so <math>3p<200</math>. The largest such prime is <math>\boxed{061}</math>, which is our answer. | Expanding the [[combination|binomial coefficient]], we get <math>{200 \choose 100}=\frac{200!}{100!100!}</math>. Let the required prime be <math>p</math>; then <math>10 \le p < 100</math>. If <math>p > 50</math>, then the factor of <math>p</math> appears twice in the denominator. Thus, we need <math>p</math> to appear as a factor at least three times in the numerator, so <math>3p<200</math>. The largest such prime is <math>\boxed{061}</math>, 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, <math>61</math> is good for this solution (if you know your primes) because <math>61 \cdot 2</math> and <math>61 \cdot 3</math> both lie in the interval <math>(100, 200)</math>. | ||
+ | |||
+ | The reason for this is because if 2 copies of the prime <math>p</math> we want to find are on the numerator and one copy on the denominator (AKA it contains <math>2p</math> and also <math>\dfrac{1}{p}</math>), 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 <math>p</math> is left after cancellation). | ||
+ | |||
+ | ~ <math>Michaellin16</math> (formatted shalomkeshet) | ||
=== Solution 2: Clarification of Solution 1 === | === Solution 2: Clarification of Solution 1 === | ||
Line 20: | Line 28: | ||
~ Nafer | ~ Nafer | ||
+ | ==Note== | ||
+ | Similar to 2023 MATHCOUNTS State Sprint #25 | ||
== See Also == | == See Also == |
Latest revision as of 10:53, 30 October 2024
Contents
[hide]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: 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
See Also
1983 AIME (Problems • Answer Key • Resources) | ||
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 |