2019 AIME I Problems/Problem 7
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 log x+log y+2(log(gcd(x,y))+log(lcm(x,y)))=630. Then, use the theorem log a+log b=log ab to get the equation log xy+2(log(gcd(x,y))+log(lcm(x,y)))=630. Use the theorem that the product of the gcd and lcm of two numbers equals to the product of the number along with the log a+log b=log ab theorem to get the equation 3log xy=630. This can easily be simplified to log xy=210, or xy = 10^210. 10^210 can be factored into 2^210 * 5^210, and m+n equals to the sum of the exponents of 2 and 5, which is 210+210 = 420. Multiply by two to get 2m +2n, which is 840. Then, use the first equation, which is log x + 2log(gcd(x,y)) = 60, to realize that x has to have a lower degree of 2 and 5 than y, therefore making the gcd x. Then, turn the equation into 3log x = 60, yielding log x = 20, or x = 10^20. Factor this into 2^20 * 5^20, and add the two 20's, resulting in m, which is 40. Add m to 2m + 2n (which is 840) to get 40+840 = 880.
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.