Difference between revisions of "2002 AIME II Problems/Problem 6"
Mathislife16 (talk | contribs) m (→Solution) |
(→Solution) |
||
Line 23: | Line 23: | ||
Then we have <math>\frac{1}{(n+2)(n-2)} = \frac{ \frac{1}{4} }{(n-2)} + \frac{ \frac{-1}{4} }{(n+2)}</math> and we can continue as before. | Then we have <math>\frac{1}{(n+2)(n-2)} = \frac{ \frac{1}{4} }{(n-2)} + \frac{ \frac{-1}{4} }{(n+2)}</math> and we can continue as before. | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
== See also == | == See also == | ||
{{AIME box|year=2002|n=II|num-b=5|num-a=7}} | {{AIME box|year=2002|n=II|num-b=5|num-a=7}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 17:32, 16 July 2017
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:
The small fractional terms are 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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.