2002 AIME II Problems/Problem 6
Problem
Find the integer that is closest to
.
Solution
We know that
.
So if we pull the
out of the summation, you get
.
Now that telescopes, leaving you with:
is not enough to bring
lower than
so the answer is
If you didn't know
, here's how you can find it out:
We know
. We can use the process of fractional decomposition to split this into two fractions thus:
for some A and B.
Solving for A and B gives
or
. Since there is no n term on the left hand side,
and by inspection
. Solving yields
Then we have
and we can continue as before.
See also
| 2002 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 5 |
Followed by Problem 7 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME 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
Although the answer to Problem 6 doesn't change, the value of the telescoping sum is incorrect as given. Instead of
the correct sum is