Difference between revisions of "1995 AIME Problems/Problem 2"
m (minor) |
(→Solution: Added a second solution) |
||
Line 4: | Line 4: | ||
== Solution == | == Solution == | ||
+ | ===Solution 1=== | ||
Taking the <math>\log_{1995}</math> ([[logarithm]]) of both sides and then moving to one side yields the [[quadratic equation]] <math>2(\log_{1995}x)^2 - 4(\log_{1995}x) + 1 = 0</math>. Applying the [[quadratic formula]] yields that <math>\log_{1995}x = 1 \pm \frac{\sqrt{2}}{2}</math>. Thus, the product of the two roots (both of which are positive) is <math>1995^{1+\sqrt{2}/2} \cdot 1995^{1 - \sqrt{2}/2} = 1995^2</math>, making the solution <math>(2000-5)^2 \equiv \boxed{025} \pmod{1000}</math>. | Taking the <math>\log_{1995}</math> ([[logarithm]]) of both sides and then moving to one side yields the [[quadratic equation]] <math>2(\log_{1995}x)^2 - 4(\log_{1995}x) + 1 = 0</math>. Applying the [[quadratic formula]] yields that <math>\log_{1995}x = 1 \pm \frac{\sqrt{2}}{2}</math>. Thus, the product of the two roots (both of which are positive) is <math>1995^{1+\sqrt{2}/2} \cdot 1995^{1 - \sqrt{2}/2} = 1995^2</math>, making the solution <math>(2000-5)^2 \equiv \boxed{025} \pmod{1000}</math>. | ||
+ | |||
+ | ===Solution 2=== | ||
+ | Instead of taking <math>\log_{1995}</math>, we take <math>\log_x</math> of both sides and simplify: | ||
+ | |||
+ | <math> \log_x(\sqrt{1995}x^{\log_{1995}x})=\log_x(x^{2}) </math> | ||
+ | |||
+ | <math> \log_x\sqrt{1995}+\log_x x^{\log_{1995}x}=2 </math> | ||
+ | |||
+ | <math>\dfrac{1}{2} \log_x 1995 + \log_{1995} x = 2</math> | ||
+ | |||
+ | Hrm... we know that <math>\log_x 1995</math> and <math>\log_{1995} x</math> are reciprocals, so let <math>a=\log_{1995} x</math>. Then we have <math>\dfrac{1}{2}\left(\dfrac{1}{a}\right) + a = 2</math>. Multiplying by <math>2a</math> and simplifying gives us <math>2a^2-4a+1=0</math>, as shown above. | ||
+ | |||
+ | By Vieta's formulas, the sum of the possible values of <math>a</math> is <math>2</math>. This means that the roots <math>x_1</math> and <math>x_2</math> that satisfy the original equation also satisfy <math>\log_{1995} x_1 + \log_{1995} x_2 = 2.</math> We can combine these logs to get <math>\log_{1995}x_1x_2=2</math>, or <math>x_1x_2=1995^2</math>. Finally, we find this value mod <math>1000</math>, which is easy. | ||
+ | |||
+ | <math>1995^2\pmod{1000}\equiv 995^2\pmod{1000}\equiv (-5)^2\pmod{1000}\equiv 25\pmod{1000}</math>, so our answer is <math>\boxed{025}</math>. | ||
== See also == | == See also == |
Revision as of 11:40, 25 August 2011
Problem
Find the last three digits of the product of the positive roots of .
Solution
Solution 1
Taking the (logarithm) of both sides and then moving to one side yields the quadratic equation . Applying the quadratic formula yields that . Thus, the product of the two roots (both of which are positive) is , making the solution .
Solution 2
Instead of taking , we take of both sides and simplify:
Hrm... we know that and are reciprocals, so let . Then we have . Multiplying by and simplifying gives us , as shown above.
By Vieta's formulas, the sum of the possible values of is . This means that the roots and that satisfy the original equation also satisfy We can combine these logs to get , or . Finally, we find this value mod , which is easy.
, so our answer is .
See also
1995 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 1 |
Followed by Problem 3 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |