1989 AMC 12 Problem 10

Attempt Problem 10 of the 1989 AMC 12 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 1989 AMC 12 solutions, or check the answer key.

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

10.

Consider the sequence defined recursively by u1=au_1=a (any positive number), and un+1=−1un+1,u_{n+1}=-\frac{1}{u_n+1}, n=1,n=1, 2,2, 3,3, ….\ldots. For which of the following values of nn must un=a?u_n=a?
1414
1515
1616
1717
1818
Answer: C
Concepts:recursionpattern recognitionrational equation
Small hint:
Compute u2,u3,u_2,u_3, and u4u_4 symbolically
Big hint:
Look for the period of the transformation x↦−1x+1x\mapsto-\frac{1}{x+1}
Solution:
Direct substitution gives u2=−1a+1,u3=−a+1a,u4=a. \begin{aligned} u_2&=-\frac1{a+1},\\ u_3&=-\frac{a+1}{a},\\ u_4&=a. \end{aligned} The sequence therefore repeats every 33 terms, so un=au_n=a whenever n≡1(mod3).n\equiv1\pmod3. Among the choices, only 1616 has that form.
Thus the correct answer is C.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.