Solution 1
Using partial fraction decomposition yields k2+k1=k(k+1)1=k1−k+11. Thus,
am+am+1+⋯+an−1=m1−m+11+m+11−m+21+⋯+n−11−n1=m1−n1
Which means that
mnn−m=291
Since we need a factor of 29 in the denominator, we let n=29t.* Substituting, we get
29t−m=mt
so
t+129t=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)=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 a1+a2+⋯+ai=i+1i. This can be proven by induction. Thus, i=m∑n−1ai=i=1∑n−1ai−i=1∑m−1ai=nn−1−mm−1=mnn−m=1/29. Cross-multiplying yields 29n−29m−mn=0, and adding 292 to both sides gives (29−m)(29+n)=292. Clearly, m<n⟹29−m=1 and 29+n=292. Hence, m=28, n=812, and m+n=840.
~ keeper1098
Solution 3
To solve this problem, I need to find two positive integers m and n where m<n and the sum of sequence terms equals 291.
First, let me simplify ak=k2+k1 using partial fractions. ak=k(k+1)1=k1−k+11
Express the sum am+am+1+⋯+an−1 using this simplification. am+am+1+⋯+an−1=∑k=mn−1(k1−k+11)
This is a telescoping series where intermediate terms cancel: am+am+1+⋯+an−1=m1−n1
Use the given condition that this sum equals 291. m1−n1=291
Multiplying both sides by mn: n−m=29mn
Rearranging: 29(n−m)=mn 29n−29m=mn 29n−mn=29m n(29−m)=29m
Solve for n in terms of m. n=29−m29m
Since n must be a positive integer, 29−m must divide 29m evenly. Since 29 is prime, for 29−m to divide 29m (when m<29), we need 29−m to divide m.
This means m=k(29−m) for some positive integer k. m=k(29−m) m=29k−km m(1+k)=29k m=1+k29k
For m to be an integer, 1+k must divide 29k. When k=28, we get m=2929(28)=28
Calculate n using our value of m. n=29−2829(28)=1812=812
Therefore, m+n=28+812=840
~ brandonyee
Video Solution by OmegaLearn
https://youtu.be/lH-0ul1hwKw?t=134
~ pi_is_3.14