Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1983 AIME Problems/Problem 8"

(→‎Solution 2: Clarification of Solution 1)
m (→‎Solution 1.5, half (desperate))
 
(14 intermediate revisions by 7 users not shown)
Line 1: Line 1:
 +
__TOC__
 +
 
== Problem ==
 
== Problem ==
 
What is the largest <math>2</math>-digit [[prime]] factor of the integer <math>n = {200\choose 100}</math>?
 
What is the largest <math>2</math>-digit [[prime]] factor of the integer <math>n = {200\choose 100}</math>?
  
−
== Solution ==
+
==Solution==
 +
=== Solution 1 ===
  
 
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 ===
  
 
We know that  
 
We know that  
Line 14: Line 24:
  
 
So basically, <math>p</math> is the largest prime number such that
 
So basically, <math>p</math> is the largest prime number such that
−
<cmath>\lfloor\frac{200}{3}\rfloor>3</cmath>
+
<cmath>\left \lfloor\frac{200}{p}\right \rfloor>3</cmath>
−
Since <math>p<\frac{200}{3}\approx66.66...</math>, the largest prime value for <math>p</math> is <math>p=61</math>
+
Since <math>p<\frac{200}{3}=66.66...</math>, the largest prime value for <math>p</math> is <math>p=\boxed{61}</math>
  
 
~ Nafer
 
~ Nafer
 +
==Note==
 +
Similar to 2023 MATHCOUNTS State Sprint #25
  
 
== See Also ==
 
== See Also ==

Latest revision as of 10:53, 30 October 2024

Problem

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

Solution

Solution 1

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 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, $61$ is good for this solution (if you know your primes) because $61 \cdot 2$ and $61 \cdot 3$ both lie in the interval $(100, 200)$.

The reason for this is because if 2 copies of the prime $p$ we want to find are on the numerator and one copy on the denominator (AKA it contains $2p$ and also $\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 $p$ is left after cancellation).

~ $Michaellin16$ (formatted shalomkeshet)

Solution 2: Clarification of Solution 1

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

So basically, $p$ is the largest prime number such that \[\left \lfloor\frac{200}{p}\right \rfloor>3\] Since $p<\frac{200}{3}=66.66...$, the largest prime value for $p$ is $p=\boxed{61}$

~ 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
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1983_AIME_Problems/Problem_8&oldid=230981"