1985 AIME Problem 13

Attempt Problem 13 of the 1985 AIME below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 1985 AIME solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

13.

The numbers in the sequence 101,101, 104,104, 109,109, 116,116, \ldots are of the form an=100+n2,a_n=100+n^2, where n=1,n=1, 2,2, 3,3, .\ldots. For each n,n, let dnd_n be the greatest common divisor of ana_n and an+1.a_{n+1}. Find the maximum value of dnd_n as nn ranges through the positive integers.

Answer: 401
Concepts:greatest common divisoralgebraic manipulationprime
Difficulty rating: 2410
Small Hint:

A common divisor of consecutive terms also divides their difference 2n+12n+1

Big Hint:

Combine n2+100n^2+100 and 2n+12n+1 to show that the gcd divides a fixed prime

Solution:

A common divisor dnd_n divides an+1an=2n+1. a_{n+1}-a_n=2n+1. It therefore also divides 4(n2+100)(2n+1)2+2(2n+1)=401. \begin{aligned} &4(n^2+100)-(2n+1)^2\\ &\qquad{}+2(2n+1)=401. \end{aligned} Since 401401 is prime, dn401.d_n\leq401. Equality occurs at n=200,n=200, because 2n+1=4012n+1=401 and n2+100=40100=100401.n^2+100=40100=100\cdot401. Hence the maximum is 401.401.

← Problem 12#12
Full Exam

Problem 13 in Other Years