2016 AMC 12B Problem 25

Below is the professionally curated solution for Problem 25 of the 2016 AMC 12B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2016 AMC 12B solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:recursionmodular arithmeticmultiplicative order

Difficulty rating: 2650

25.

The sequence (an)(a_n) is defined recursively by a0=1,a_0=1, a1=219,a_1=\sqrt[19]{2}, and an=an1an22a_n=a_{n-1}a_{n-2}^2 for n2.n\ge2. What is the smallest positive integer kk such that the product a1a2aka_1a_2\cdots a_k is an integer?

1717

1818

1919

2020

2121

Solution:

Write an=2bn/19.a_n=2^{b_n/19}. The recursion becomes b0=0,b_0=0, b1=1,b_1=1, bn=bn1+2bn2,b_n=b_{n-1}+2b_{n-2}, solved by bn=13(2n(1)n).b_n=\tfrac13\bigl(2^n-(-1)^n\bigr). The product a1aka_1\cdots a_k is an integer exactly when 19b1++bk.19\mid b_1+\cdots+b_k. For odd k,k, this sum equals 13(2k+11),\tfrac13(2^{k+1}-1), which is a multiple of 1919 exactly when 192k+11,19\mid2^{k+1}-1, i.e. when the order of 22 modulo 19,19, namely 18,18, divides k+1.k+1. The smallest such odd kk is k+1=18,k+1=18, so k=17.k=17.

Thus, the correct answer is A.

Problem 25 in Other Years