Difference between revisions of "2002 AIME I Problems/Problem 4"
Made in 2016 (talk | contribs) m (Made the asterisk note at the end more obvious that it refers to the asterisk, got rid of that weird extra plus, and changed the wording a tiny bit) |
Made in 2016 (talk | contribs) m (Changed the wording a tiny bit again to make it clearer.) |
||
Line 7: | Line 7: | ||
<math>a_m+a_{m+1}+\cdots +a_{n-1}=\dfrac{1}{m}-\dfrac{1}{m+1}+\dfrac{1}{m+1}-\dfrac{1}{m+2}+\cdots +\dfrac{1}{n-1}-\dfrac{1}{n}=\dfrac{1}{m}-\dfrac{1}{n}</math> | <math>a_m+a_{m+1}+\cdots +a_{n-1}=\dfrac{1}{m}-\dfrac{1}{m+1}+\dfrac{1}{m+1}-\dfrac{1}{m+2}+\cdots +\dfrac{1}{n-1}-\dfrac{1}{n}=\dfrac{1}{m}-\dfrac{1}{n}</math> | ||
− | Which means | + | Which means that |
<math>\dfrac{n-m}{mn}=\dfrac{1}{29}</math> | <math>\dfrac{n-m}{mn}=\dfrac{1}{29}</math> | ||
− | Since we need a 29 in the denominator, we let <math>n=29t</math>.* Substituting, we get | + | Since we need a factor of 29 in the denominator, we let <math>n=29t</math>.* Substituting, we get |
<math>29t-m=mt</math> | <math>29t-m=mt</math> | ||
+ | |||
+ | so | ||
<math>\frac{29t}{t+1} = m</math> | <math>\frac{29t}{t+1} = m</math> | ||
− | Since m is an integer, <math>t+1 = 29</math>, | + | Since <math>m</math> is an integer, <math>t+1 = 29</math>, so <math>t=28</math>. It quickly follows that <math>n=29(28)</math> and <math>m=28</math>, so <math>m+n = 30(28) = \fbox{840}</math>. |
*If <math>m=29t</math>, a similar argument to the one above implies <math>m=29(28)</math> and <math>n=28</math>, which implies <math>m>n</math>. This is impossible since <math>n-m>0</math>. | *If <math>m=29t</math>, a similar argument to the one above implies <math>m=29(28)</math> and <math>n=28</math>, which implies <math>m>n</math>. This is impossible since <math>n-m>0</math>. |
Revision as of 22:18, 11 July 2017
Problem
Consider the sequence defined by for . Given that , for positive integers and with , find .
Solution
. Thus,
Which means that
Since we need a factor of 29 in the denominator, we let .* Substituting, we get
so
Since is an integer, , so . It quickly follows that and , so .
*If , a similar argument to the one above implies and , which implies . This is impossible since .
See also
2002 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
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.