AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.

2006 AMC 10B Problems/Problem 18

From AoPSWiki

Revision as of 01:32, 4 August 2006 by Xantos C. Guin (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Problem

Let a_1 , a_2 , ... be a sequence for which

a_1=2 , a_2=3, and a_n=\frac{a_{n-1}}{a_{n-2}} for each positive integer n \ge 3.

What is a_{2006}?

\mathrm{(A) \ } \frac{1}{2}\qquad \mathrm{(B) \ } \frac{2}{3}\qquad \mathrm{(C) \ } \frac{3}{2}\qquad \mathrm{(D) \ } 2\qquad...

Solution

Looking at the first few terms of the sequence:

a_1=2 , a_2=3 , a_3=\frac{3}{2}, a_4=\frac{1}{2} , a_5=\frac{1}{3} , a_6=\frac{2}{3} , a_7=2 , a_8=3 , ....

Clearly, the sequence repeats every 6 terms.

Since 2006 \equiv 2\bmod{6},

a_{2006} = a_2 = 3 \Rightarrow E

See Also

Art of Problem Solving celebrates the many
accomplishments of its students and community members.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us