Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2002 AIME I Problems/Problem 4"

(→‎Solution 2)
m (added link)
 
Line 3: Line 3:
  
 
== Solution 1 ==
 
== Solution 1 ==
−
<math>\dfrac{1}{k^2+k}=\dfrac{1}{k(k+1)}=\dfrac{1}{k}-\dfrac{1}{k+1}</math>. Thus,
+
Using [[partial fraction decomposition]] yields <math>\dfrac{1}{k^2+k}=\dfrac{1}{k(k+1)}=\dfrac{1}{k}-\dfrac{1}{k+1}</math>. Thus,
  
 
<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>
Line 22: Line 22:
  
 
  *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>.
−
 
  
 
== Solution 2 ==
 
== Solution 2 ==

Latest revision as of 10:27, 5 October 2024

Problem

Consider the sequence defined by $a_k =\dfrac{1}{k^2+k}$ for $k\geq 1$. Given that $a_m+a_{m+1}+\cdots+a_{n-1}=\dfrac{1}{29}$, for positive integers $m$ and $n$ with $m<n$, find $m+n$.

Solution 1

Using partial fraction decomposition yields $\dfrac{1}{k^2+k}=\dfrac{1}{k(k+1)}=\dfrac{1}{k}-\dfrac{1}{k+1}$. Thus,

$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}$

Which means that

$\dfrac{n-m}{mn}=\dfrac{1}{29}$

Since we need a factor of 29 in the denominator, we let $n=29t$.* Substituting, we get

$29t-m=mt$

so

$\frac{29t}{t+1} = m$

Since $m$ is an integer, $t+1 = 29$, so $t=28$. It quickly follows that $n=29(28)$ and $m=28$, so $m+n = 30(28) = \fbox{840}$. 

*If $m=29t$, a similar argument to the one above implies $m=29(28)$ and $n=28$, which implies $m>n$. This is impossible since $n-m>0$.

Solution 2

Note that $a_1 + a_2 + \cdots + a_i = \dfrac{i}{i+1}$. This can be proven by induction. Thus, $\sum\limits_{i=m}^{n-1} a_i = \sum\limits_{i=1}^{n-1} a_i - \sum\limits_{i=1}^{m-1} a_i = \dfrac{n-1}{n} - \dfrac{m-1}{m} = \dfrac{n-m}{mn} = 1/29$. Cross-multiplying yields $29n - 29m - mn = 0$, and adding $29^2$ to both sides gives $(29-m)(29+n) = 29^2$. Clearly, $m < n \implies 29 - m = 1$ and $29 + n = 29^2$. Hence, $m = 28$, $n = 812$, and $m+n = \fbox{840}$.

~ keeper1098

Video Solution by OmegaLearn

https://youtu.be/lH-0ul1hwKw?t=134

~ pi_is_3.14

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2002_AIME_I_Problems/Problem_4&oldid=228986"