Difference between revisions of "2001 AIME II Problems/Problem 3"
Pi is 3.14 (talk | contribs) (→Solution Variant) |
|||
Line 34: | Line 34: | ||
Notice that we didn't need to use the values of <math>x_1</math> or <math>x_3</math> at all. | Notice that we didn't need to use the values of <math>x_1</math> or <math>x_3</math> at all. | ||
+ | |||
+ | == Video Solution by OmegaLearn == | ||
+ | https://youtu.be/lH-0ul1hwKw?t=870 | ||
+ | |||
+ | ~ pi_is_3.14 | ||
+ | |||
== See also == | == See also == | ||
{{AIME box|year=2001|n=II|num-b=2|num-a=4}} | {{AIME box|year=2001|n=II|num-b=2|num-a=4}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 07:56, 4 November 2022
Problem
Given that
find the value of .
Solution
We find that by the recursive formula. Summing the recursions
yields . Thus
. Since
, it follows that
Solution Variant
The recursive formula suggests telescoping. Indeed, if we add and
, we have
.
Subtracting yields
.
Thus,
Notice that we didn't need to use the values of or
at all.
Video Solution by OmegaLearn
https://youtu.be/lH-0ul1hwKw?t=870
~ pi_is_3.14
See also
2001 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
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.