Difference between revisions of "2019 AIME I Problems/Problem 7"
m (→Problem 7) |
m (→Problem 7: formatting) |
||
Line 1: | Line 1: | ||
==Problem 7== | ==Problem 7== | ||
− | There are positive integers <math>x</math> and <math>y</math> that satisfy the system of equations <cmath>\log_{10} x + 2 \log_{10} (\text{gcd}(x,y)) = 60 | + | There are positive integers <math>x</math> and <math>y</math> that satisfy the system of equations <cmath> |
+ | \begin{align*} | ||
+ | \log_{10} x + 2 \log_{10} (\text{gcd}(x,y)) &= 60\\ | ||
+ | \log_{10} y + 2 \log_{10} (\text{lcm}(x,y)) &= 570. | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | Let <math>m</math> be the number of (not necessarily distinct) prime factors in the prime factorization of <math>x</math>, and let <math>n</math> be the number of (not necessarily distinct) prime factors in the prime factorization of <math>y</math>. Find <math>3m+2n</math>. | ||
==Solution== | ==Solution== |
Revision as of 20:06, 15 March 2019
Contents
Problem 7
There are positive integers and that satisfy the system of equations Let be the number of (not necessarily distinct) prime factors in the prime factorization of , and let be the number of (not necessarily distinct) prime factors in the prime factorization of . Find .
Solution
Add the two equations to get that . Then, we use the theorem to get the equation, . Using the theorem that , along with the previously mentioned theorem, we can get the equation . This can easily be simplified to , or .
can be factored into , and equals to the sum of the exponents of 2 and 5, which is . Multiply by two to get , which is . Then, use the first equation () to show that x has to have lower degrees of 2 and 5 than y. Therefore, making the . Then, turn the equation into , which yields , or . Factor this into , and add the two 20's, resulting in m, which is 40. Add to (which is 840) to get .
Solution 2 (Crappier Solution)
First simplifying the first and second equations, we get that
Thus, when the two equations are added, we have that
When simplified, this equals
so this means that
so
Now, the following cannot be done on a proof contest but let's (intuitively) assume that and and are both powers of . This means the first equation would simplify to and Therefore, and and if we plug these values back, it works! has total factors and has so
Please remember that you should only assume on these math contests because they are timed; this would technically not be a valid solution.
Solution 3 (Easy Solution)
Let and and . Then the given equations become and . Therefore, and . Our answer is .
See Also
2019 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
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.