返回题库

AIME 2002 I · 第 4 题

AIME 2002 I — Problem 4

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Consider the sequence defined by ak=1k2+ka_k =\dfrac{1}{k^2+k} for k1k\geq 1. Given that am+am+1++an1=129a_m+a_{m+1}+\cdots+a_{n-1}=\dfrac{1}{29}, for positive integers mm and nn with m,findm, findm+n$.

解析

Solution 1

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

am+am+1++an1=1m1m+1+1m+11m+2++1n11n=1m1na_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

nmmn=129\dfrac{n-m}{mn}=\dfrac{1}{29}

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

29tm=mt29t-m=mt

so

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

Since mm is an integer, t+1=29t+1 = 29, so t=28t=28. It quickly follows that n=29(28)n=29(28) and m=28m=28, so m+n=30(28)=840m+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 a1+a2++ai=ii+1a_1 + a_2 + \cdots + a_i = \dfrac{i}{i+1}. This can be proven by induction. Thus, i=mn1ai=i=1n1aii=1m1ai=n1nm1m=nmmn=1/29\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 29n29mmn=029n - 29m - mn = 0, and adding 29229^2 to both sides gives (29m)(29+n)=292(29-m)(29+n) = 29^2. Clearly, m<n    29m=1m < n \implies 29 - m = 1 and 29+n=29229 + n = 29^2. Hence, m=28m = 28, n=812n = 812, and m+n=840m+n = \fbox{840}.

~ keeper1098

Solution 3

To solve this problem, I need to find two positive integers mm and nn where m<nm < n and the sum of sequence terms equals 129\frac{1}{29}.

First, let me simplify ak=1k2+ka_k = \frac{1}{k^2 + k} using partial fractions. ak=1k(k+1)=1k1k+1a_k = \frac{1}{k(k+1)} = \frac{1}{k} - \frac{1}{k+1}

Express the sum am+am+1++an1a_m + a_{m+1} + \cdots + a_{n-1} using this simplification. am+am+1++an1=k=mn1(1k1k+1)a_m + a_{m+1} + \cdots + a_{n-1} = \sum_{k=m}^{n-1} \left(\frac{1}{k} - \frac{1}{k+1}\right)

This is a telescoping series where intermediate terms cancel: am+am+1++an1=1m1na_m + a_{m+1} + \cdots + a_{n-1} = \frac{1}{m} - \frac{1}{n}

Use the given condition that this sum equals 129\frac{1}{29}. 1m1n=129\frac{1}{m} - \frac{1}{n} = \frac{1}{29}

Multiplying both sides by mnmn: nm=mn29n - m = \frac{mn}{29}

Rearranging: 29(nm)=mn29(n - m) = mn 29n29m=mn29n - 29m = mn 29nmn=29m29n - mn = 29m n(29m)=29mn(29 - m) = 29m

Solve for nn in terms of mm. n=29m29mn = \frac{29m}{29-m}

Since nn must be a positive integer, 29m29-m must divide 29m29m evenly. Since 2929 is prime, for 29m29-m to divide 29m29m (when m<29m < 29), we need 29m29-m to divide mm.

This means m=k(29m)m = k(29-m) for some positive integer kk. m=k(29m)m = k(29-m) m=29kkmm = 29k - km m(1+k)=29km(1+k) = 29k m=29k1+km = \frac{29k}{1+k}

For mm to be an integer, 1+k1+k must divide 29k29k. When k=28k = 28, we get m=29(28)29=28m = \frac{29(28)}{29} = 28

Calculate nn using our value of mm. n=29(28)2928=8121=812n = \frac{29(28)}{29-28} = \frac{812}{1} = 812

Therefore, m+n=28+812=840m + n = 28 + 812 = \boxed{840}

~ brandonyee

Video Solution by OmegaLearn

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

~ pi_is_3.14