Difference between revisions of "2019 AIME I Problems/Problem 7"
Schintalpati (talk | contribs) (Solution 8) |
Technodoggo (talk | contribs) m (→Easier Approach to Finish: slight note) |
||
Line 30: | Line 30: | ||
<cmath>a+2a=60</cmath> | <cmath>a+2a=60</cmath> | ||
<cmath>b+2b=570</cmath> | <cmath>b+2b=570</cmath> | ||
− | Solving, we get <math>(a,b)=(20,190).</math> This matches with our constraint that <math>xy=10^{210} | + | Solving, we get <math>(a,b)=(20,190).</math> This matches with our constraint that <math>xy=10^{210}</math> (this constraint can actually be rederived by adding the two equations) so we finish from here. |
− | <math>x=2^{20}\cdot 5^{20}, y=2^{190}\cdot 5^{190}.</math> Thus, the answer desired is <math>3(20+20)+2(190+190)=880.</math> ~mathboy282 | + | <math>x=2^{20}\cdot 5^{20}, y=2^{190}\cdot 5^{190}.</math> Thus, the answer desired is <math>3(20+20)+2(190+190)=880.</math> ~mathboy282 (minor addition by Technodoggo) |
==Solution 2== | ==Solution 2== |
Latest revision as of 00:44, 23 October 2024
Contents
[hide]Problem
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 1
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 and , which is . Multiply by two to get , which is . Then, use the first equation () to show that has to have lower degrees of and than (you can also test when , which is a contradiction to the restrains we set before). Therefore, . Then, turn the equation into , which yields , or . Factor this into , and add the two 20's, resulting in , which is . Add to (which is ) to get .
~minor mistake fix by virjoy2001 ~minor mistake fix by oralayhan
Remark: You can obtain the contradiction by using LTE. If . However, a contradiction. Same goes with taking
Easier Approach to Finish
After noting that notice that we can let and Thus, we have from the given equations (1) and (2) respectively, that: Solving, we get This matches with our constraint that (this constraint can actually be rederived by adding the two equations) so we finish from here.
Thus, the answer desired is ~mathboy282 (minor addition by Technodoggo)
Solution 2
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 .
Solution 4
We will use the notation for and as . We can start with a similar way to Solution 1. We have, by logarithm properties, or . We can do something similar to the second equation and our two equations become Adding the two equations gives us . Since we know that , , or . We can express as and as . Another way to express is now , and is now . We know that , and thus, , and . Our equations for and now become or . Doing the same for the equation, we have , and , which satisfies . Thus, . ~awsomek
Solution 5
Let . Simplifying, . Notice that since are coprime, and (Prove it yourself !) , . Hence, giving the answer .
(Solution by Prabh1512)
Solution 6 (Official MAA)
The two equations are equivalent to and respectively. Multiplying corresponding sides of the equations leads to , so . It follows that there are nonnegative integers and such that with . Furthermore, Thus Because neither nor can equal when it follows that . Hence , so the prime factorization of has prime factors, and the prime factorization of has prime factors. The requested sum is
Solution 7
Add the two equations and use the fact that to find that . So let and for . If then the exponent of in is , so , contradiction. So . Then the exponent of in is , so . Similarly, . Then as desired.
~from trumpeter in the AoPS Forums Contest Discussion
Solution 8
We can simplify the equations step by step. The first equation simplifies to (x)(). The second equation simplifies to log((). Up to here, we used the exponent and addition log identities.
Now before we move on to the next few simplification steps, we must remember that *=.
Due to the fact that these log's are in base , this makes the first and second equation equal to , respectively. In this step, we switched the log's into exponential form. Now we multiply both equations to get *=()()=. Now we take the cube root of both sides to get .
We've now gotten to the crucial part of this equation. Though this wouldn't pass for full points in a proof-based contest, this is AIME. So, we assume that . We also let = and = That means that is and the is due to the fact that we are also assuming that both are , respectively.
If we put our last few insights together into the first and second equation, we see that =. We also see that =. We could check these if wanted (don't worry they work), but if you were very limited on time for this question, just assume these values work and move on.
Now factors as *. This has prime factors. , times and , times. factors as *. This has prime factors. , times and , times. Now it's just as our final answer.
-Schintalpati
Video Solution(Pretty Straightforward)
https://www.youtube.com/watch?v=NOLk9-A4eDo Remember to subscribe!
~North America math Contest Go Go Go
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.