1985 AHSME Problems/Problem 27
Problem
Consider a sequence
defined by:
and in general
What is the smallest value of
for which
is an integer?
Solution
Firstly, we will show by induction that
For the base case, we indeed have
and for the inductive step, if our claim is true for
, then
which completes the proof.
We now rewrite our formula for
as follows:
and as
is not a perfect power, we deduce that
is an integer if and only if the exponent,
, is itself an integer. By precisely the same argument, this reduces to
being an integer, so the smallest possible (positive) value of
is
.
See Also
| 1985 AHSME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 26 |
Followed by Problem 28 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
| All AHSME Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: File missing