1990 USAMO Problems/Problem 2
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
must be nonnegative, since the natural root of any number is
. Solving for
, we get
and only
. We solve for
:
We get again. We can conjecture that
is the only solution.
Plugging into
, we get
So if 4 is a solution for , it is a solution for
. 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 |