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 "2010 AIME I Problems/Problem 1"

(→‎See Also)
(Video solution should be in a separate section. Not attached to SEE ALSO.)
Line 11: Line 11:
 
Thus, the probability is  
 
Thus, the probability is  
 
<cmath>\frac {\binom{16}{1}\binom{81-16}{1}}{\binom{81}{2}} = \frac {16\cdot65}{81\cdot40} = \frac {26}{81} \Longrightarrow 26+ 81 = \boxed{107}.</cmath>
 
<cmath>\frac {\binom{16}{1}\binom{81-16}{1}}{\binom{81}{2}} = \frac {16\cdot65}{81\cdot40} = \frac {26}{81} \Longrightarrow 26+ 81 = \boxed{107}.</cmath>
 +
 +
== Video Solution ==
 +
https://www.youtube.com/watch?v=YJeF9dLJZuw (Osman Nal)
  
 
== See Also ==
 
== See Also ==
−
Video Solution by Osman Nal: https://www.youtube.com/watch?v=YJeF9dLJZuw
 
 
{{AIME box|year=2010|before=First Problem|num-a=2|n=I}}
 
{{AIME box|year=2010|before=First Problem|num-a=2|n=I}}
  
 
[[Category:Introductory Number Theory Problems]]
 
[[Category:Introductory Number Theory Problems]]
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 22:25, 25 June 2021

Problem

Maya lists all the positive divisors of $2010^2$. She then randomly selects two distinct divisors from this list. Let $p$ be the probability that exactly one of the selected divisors is a perfect square. The probability $p$ can be expressed in the form $\frac {m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Solution

$2010^2 = 2^2\cdot3^2\cdot5^2\cdot67^2$. Thus there are $(2+1)^4$ divisors, $2^4$ of which are squares (the exponent of each prime factor must either be $0$ or $2$). Therefore the probability is \[\frac {2\cdot2^4\cdot(3^4 - 2^4)}{3^4(3^4 - 1)} = \frac {26}{81} \Longrightarrow 26+ 81 = \boxed{107}.\]

Solution 2: Using a bit more counting

The prime factorization of $2010^2$ is $67^2\cdot3^2\cdot2^2\cdot5^2$. Therefore, the number of divisors of $2010^2$ is $3^4$ or $81$, $16$ of which are perfect squares. The number of ways we can choose $1$ perfect square from the two distinct divisors is $\binom{16}{1}\binom{81-16}{1}$. The total number of ways to pick two divisors is $\binom{81}{2}$

Thus, the probability is \[\frac {\binom{16}{1}\binom{81-16}{1}}{\binom{81}{2}} = \frac {16\cdot65}{81\cdot40} = \frac {26}{81} \Longrightarrow 26+ 81 = \boxed{107}.\]

Video Solution

https://www.youtube.com/watch?v=YJeF9dLJZuw (Osman Nal)

See Also

2010 AIME I (Problems • Answer Key • Resources)
Preceded by
First Problem 		Followed by
Problem 2
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2010_AIME_I_Problems/Problem_1&oldid=156852"