Maths Olympiad Prep

Track / Stage 3 / 63 of 260 #703 of 2604

Problem 703

AMC 10/12, early questions
Algebra Difficulty 3.2 Find the answer CEMC Fermat

A sequence of numbers t1,t2,t3,…t_{1}, t_{2}, t_{3}, \ldots has its terms defined by tn=1n−1n+2t_{n}=\frac{1}{n}-\frac{1}{n+2} for every integer n≥1n \geq 1. What is the largest positive integer kk for which the sum of the first kk terms is less than 1.499?

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Next problem →

Official solution

We note that t1=11−13=23≈0.67t_{1}=\frac{1}{1}-\frac{1}{3}=\frac{2}{3} \approx 0.67, t1+t2=(11−13)+(12−14)=23+14=1112≈0.92t_{1}+t_{2}=\left(\frac{1}{1}-\frac{1}{3}\right)+\left(\frac{1}{2}-\frac{1}{4}\right)=\frac{2}{3}+\frac{1}{4}=\frac{11}{12} \approx 0.92, t1+t2+t3=(11−13)+(12−14)+(13−15)=11+12+13−13−14−15=11+12−14−15=1.05t_{1}+t_{2}+t_{3}=\left(\frac{1}{1}-\frac{1}{3}\right)+\left(\frac{1}{2}-\frac{1}{4}\right)+\left(\frac{1}{3}-\frac{1}{5}\right)=\frac{1}{1}+\frac{1}{2}+\frac{1}{3}-\frac{1}{3}-\frac{1}{4}-\frac{1}{5}=\frac{1}{1}+\frac{1}{2}-\frac{1}{4}-\frac{1}{5}=1.05, t1+t2+t3+t4=(11−13)+(12−14)+(13−15)+(14−16)=11+12+13+14−13−14−15−16=11+12−15−16≈1.13t_{1}+t_{2}+t_{3}+t_{4}=\left(\frac{1}{1}-\frac{1}{3}\right)+\left(\frac{1}{2}-\frac{1}{4}\right)+\left(\frac{1}{3}-\frac{1}{5}\right)+\left(\frac{1}{4}-\frac{1}{6}\right)=\frac{1}{1}+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}-\frac{1}{3}-\frac{1}{4}-\frac{1}{5}-\frac{1}{6}=\frac{1}{1}+\frac{1}{2}-\frac{1}{5}-\frac{1}{6} \approx 1.13. This means that the sum of the first kk terms is less than 1.499 for k=1,2,3,4k=1,2,3,4. When k>4k>4, we can extend the pattern that we saw for k=3k=3 and k=4k=4 to note that t1+t2+t3+…+tk−1+tk=(11−13)+(12−14)+(13−15)+⋯+(1k−1−1k+1)+(1k−1k+2)=11+12+13+⋯+1k−1+1k−13−14−15−⋯−1k+1−1k+2=11+12−1k+1−1k+2=1.500−1k+1−1k+2t_{1}+t_{2}+t_{3}+\ldots+t_{k-1}+t_{k}=\left(\frac{1}{1}-\frac{1}{3}\right)+\left(\frac{1}{2}-\frac{1}{4}\right)+\left(\frac{1}{3}-\frac{1}{5}\right)+\cdots+\left(\frac{1}{k-1}-\frac{1}{k+1}\right)+\left(\frac{1}{k}-\frac{1}{k+2}\right)=\frac{1}{1}+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{k-1}+\frac{1}{k}-\frac{1}{3}-\frac{1}{4}-\frac{1}{5}-\cdots-\frac{1}{k+1}-\frac{1}{k+2}=\frac{1}{1}+\frac{1}{2}-\frac{1}{k+1}-\frac{1}{k+2}=1.500-\frac{1}{k+1}-\frac{1}{k+2}. This means that the sum of the first kk terms is less than 1.499 exactly when 1k+1+1k+2\frac{1}{k+1}+\frac{1}{k+2} is greater than 0.001. As kk increases from 4, each of 1k+1\frac{1}{k+1} and 1k+2\frac{1}{k+2} decreases, which means that their sum decreases as well. When k=1998,1k+1+1k+2=11999+12000>12000+12000=11000=0.001k=1998, \frac{1}{k+1}+\frac{1}{k+2}=\frac{1}{1999}+\frac{1}{2000}>\frac{1}{2000}+\frac{1}{2000}=\frac{1}{1000}=0.001. When k=1999,1k+1+1k+2=12000+12001<12000+12000=11000=0.001k=1999, \frac{1}{k+1}+\frac{1}{k+2}=\frac{1}{2000}+\frac{1}{2001}<\frac{1}{2000}+\frac{1}{2000}=\frac{1}{1000}=0.001. This means that 1k+1+1k+2\frac{1}{k+1}+\frac{1}{k+2} is greater than 0.001 exactly when k≤1998k \leq 1998 and is less than 0.001 when k≥1999k \geq 1999. In other words, the sum of the first kk terms is less than 1.499 for k=1,2,3,4k=1,2,3,4 as well as for 5≤k≤19985 \leq k \leq 1998, which is the same as saying that this is true for 1≤k≤19981 \leq k \leq 1998. Therefore, k=1998k=1998 is the largest positive integer for which the sum of the first kk terms is less than 1.499.

Source: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.