Difference between revisions of "1990 USAMO Problems/Problem 2"
Line 12: | Line 12: | ||
==Solution== | ==Solution== | ||
+ | |||
+ | x must be positive, since if x is negative, we would be taking a negative square root. | ||
+ | |||
+ | Solving for n=1, we get x=4 and only 4. We solve for n=2: | ||
+ | |||
+ | <math>2x=\sqrt{x^2+6\sqrt{x^2+48}}</math> | ||
+ | |||
+ | <math>3x^2=6\sqrt{x^2+48}</math> | ||
+ | |||
+ | <math>x^4=4x^2+192</math> | ||
+ | |||
+ | <math>x^2=\dfrac{4+28}{2}=16</math> | ||
+ | |||
+ | <math>x=4</math> | ||
+ | |||
+ | We get x=4 again. We can conjecture that x=4 is the only solution. | ||
+ | |||
+ | Plugging 2x=8 into <math>f_n(x)</math>, we get | ||
+ | |||
+ | <math>f_{n+1}(x)=\sqrt{x^2+48}</math> | ||
+ | |||
+ | So if 4 is a solution for n=x, it is a solution for n=x+1. From induction, 4 is a solution for all n. | ||
{{solution}} | {{solution}} | ||
+ | |||
==See Also== | ==See Also== | ||
{{USAMO box|year=1990|num-b=1|num-a=3}} | {{USAMO box|year=1990|num-b=1|num-a=3}} |
Revision as of 07:58, 19 October 2007
Problem
A sequence of functions is defined recursively as follows:
(Recall that is understood to represent the positive square root.) For each positive integer , find all real solutions of the equation .
Solution
x must be positive, since if x is negative, we would be taking a negative square root.
Solving for n=1, we get x=4 and only 4. We solve for n=2:
We get x=4 again. We can conjecture that x=4 is the only solution.
Plugging 2x=8 into , we get
So if 4 is a solution for n=x, it is a solution for n=x+1. From induction, 4 is a solution for all n.
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
1990 USAMO (Problems • Resources) | ||
Preceded by Problem 1 |
Followed by Problem 3 | |
1 • 2 • 3 • 4 • 5 | ||
All USAMO Problems and Solutions |