返回题库

AIME 2016 I · 第 5 题

AIME 2016 I — Problem 5

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem 5

Anh read a book. On the first day she read nn pages in tt minutes, where nn and tt are positive integers. On the second day Anh read n+1n + 1 pages in t+1t + 1 minutes. Each day thereafter Anh read one more page than she read on the previous day, and it took her one more minute than on the previous day until she completely read the 374374 page book. It took her a total of 319319 minutes to read the book. Find n+tn + t.

解析

Solution 1

Let dd be the number of days Anh reads for. Because the difference between the number of pages and minutes Anh reads for each day stays constant and is an integer, dd must be a factor of the total difference, which is 374319=55374-319=55. Also note that the number of pages Anh reads is dn+d(d1)2dn+\frac{d(d-1)}{2}. Similarly, the number of minutes she reads for is dt+d(d1)2dt+\frac{d(d-1)}{2}. When dd is odd (which it must be), both of these numbers are multiples of dd. Therefore, dd must be a factor of 5555, 319319, and 374374. The only such numbers are 11 and 1111. We know that Anh reads for at least 22 days. Therefore, d=11d=11.

Using this, we find that she reads 5555 "additional" pages and 5555 "additional" minutes. Therefore, n=3745511=29n=\frac{374-55}{11}=29, while t=3195511=24t=\frac{319-55}{11}=24. The answer is therefore 29+24=05329+24=\fbox{053}.

Solution 2

We could see that both 374374 and 319319 are divisible by 1111 in the outset, and that 3434 and 2929, the quotients, are relatively prime. Both are the averageaverage number of minutes across the 1111 days, so we need to subtract 112=5\left \lfloor{\frac{11}{2}}\right \rfloor=5 from each to get (n,t)=(29,24)(n,t)=(29,24) and 29+24=05329+24=\boxed{053}.

Solution 3

If we let kk be equal to the number of days it took to read the book, the sum of nn through n+kn+k is equal to (2n+k)(k+1)=748(2n+k)(k+1)=748 Similarly, (2t+k)(k+1)=638(2t+k)(k+1)=638 We know that both factors must be integers and we see that the only common multiple of 748748 and 638638 not equal to 11 that will get us positive integer solutions for nn and tt is 1111. We set k+1=11k+1=11 so k=10k=10. We then solve for nn and tt in their respective equations, getting 2n+10=682n+10=68. n=29n=29 We also get 2t+10=582t+10=58. t=24t=24. Our final answer is 29+24=05329+24=\boxed{053}

Solution 4

Notice 374=3411374=34\cdot 11 and 319=2911319=29\cdot 11. Also, note the sum of an arithmetic series is 2n+k2b\frac{2n+k}{2} \cdot b, where nn is our first term, n+kn+k is our final term, and bb is the number of terms. Since we know both sequences of nn and tt have the same length, and since 1111 is prime and shared by both 319319 and 374374, we deduce that b=11b=11. Thus from here we know 2n+k=682n+k=68 and 2t+k=582t+k=58 by using our other factors 3434 and 2929. Finally, we add the two systems up and we get 2t+2k+2n=1262t+2k+2n=126. But, notice that k=b1k=b-1, since the first term has k=0k=0, and our last term has k=b1k=b-1. Plugging this back into our equation we get 2n+2t=106    n+t=0532n+2t=106 \implies n+t=\boxed{053}

Solution 5

We list two equations: \begin{align*} n+(n+1)+...+(n+k)&=374\\ t+(t+1)+...+(t+k)&=319. \end{align*} Subtracting the two, we get:

(nt)(k+1)=374319=55.(n-t)(k+1)=374-319=55. Manipulating the first and second equation, we get: \begin{align*} n(k+1)+\frac{k(k+1)}{2}&=374 \\ t(k+1)+\frac{k(k+1)}{2}&=319. \end{align*} We factor out the common factor k+1k+1: \begin{align*} (k+1)\left(n+\frac{k}{2}\right)&=374 \\ (k+1)\left(t+\frac{k}{2}\right)&=319. \end{align*} Note that 374374 and 319319 have a GCD of 11,11, now combining this with our equation that (nt)(k+1)=55,(n-t)(k+1)=55, we see that k+1k+1 has to equal 11.11. Thus, we get:

(n,t)=(29,24)n+t=29+24=053.(n,t)=(29,24) \Rightarrow n+t=29+24=\boxed{053}. Note: We see that because n-t=5, it becomes impossible for n+k/2 and t+k/2 to both be multiples of 11. Thus, this satisfies our condition. Thus k+1 must be 11 to satisfy the common factor 11 constraint. mathboy282