Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2016 AMC 12B Problems/Problem 25"

(Created page with "==Problem== The sequence <math>(a_n)</math> is defined recursively by <math>a_0=1</math>, <math>a_1=\sqrt[19]{2}</math>, and <math>a_n=a_{n-1}a_{n-2}^2</math> for <math>n\geq ...")
 
(→‎Problem)
Line 3: Line 3:
  
 
<math>\textbf{(A)}\ 17\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 19\qquad\textbf{(D)}\ 20\qquad\textbf{(E)}\ 21</math>
 
<math>\textbf{(A)}\ 17\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 19\qquad\textbf{(D)}\ 20\qquad\textbf{(E)}\ 21</math>
 +
 +
==Solution==
 +
 +
Let <math>b_i=19\text{log}_2a_i</math>. Then <math>b_0=0, b_1=1,</math> and <math>b_n=b_{n-1}+2b_{n-2}</math> for all <math>n\geq 2</math>. The characteristic polynomial of this linear recurrence is <math>x^2-x-2=0</math>, which has roots <math>2</math> and <math>-1</math>. Therefore, <math>b_n=k_12^{n}+k_2(-1)^n</math> for constants to be determined <math>k_1, k_2</math>. Using the fact that <math>b_0=0, b_1=1,</math> we can solve a pair of linear equations for <math>k_1, k_2</math>:
 +
 +
<math>k_1+k_2=0</math>
 +
<math>2k_1-k_2=1</math>.
 +
 +
Thus <math>k_1=\frac{1}{3}</math>, <math>k_2=-\frac{1}{3}</math>, and <math>b_n=\frac{2^n-(-1)^n}{3}</math>.
 +
 +
Now, <math>a_1a_2\cdots a_k=2^{\frac{(b_1+b_2+\cdots+b_k)}{19}}</math>, so we are looking for the least value of <math>k</math> so that

Revision as of 12:12, 21 February 2016

Problem

The sequence $(a_n)$ is defined recursively by $a_0=1$, $a_1=\sqrt[19]{2}$, and $a_n=a_{n-1}a_{n-2}^2$ for $n\geq 2$. What is the smallest positive integer $k$ such that the product $a_1a_2\cdots a_k$ is an integer?

$\textbf{(A)}\ 17\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 19\qquad\textbf{(D)}\ 20\qquad\textbf{(E)}\ 21$

Solution

Let $b_i=19\text{log}_2a_i$. Then $b_0=0, b_1=1,$ and $b_n=b_{n-1}+2b_{n-2}$ for all $n\geq 2$. The characteristic polynomial of this linear recurrence is $x^2-x-2=0$, which has roots $2$ and $-1$. Therefore, $b_n=k_12^{n}+k_2(-1)^n$ for constants to be determined $k_1, k_2$. Using the fact that $b_0=0, b_1=1,$ we can solve a pair of linear equations for $k_1, k_2$:

$k_1+k_2=0$ $2k_1-k_2=1$.

Thus $k_1=\frac{1}{3}$, $k_2=-\frac{1}{3}$, and $b_n=\frac{2^n-(-1)^n}{3}$.

Now, $a_1a_2\cdots a_k=2^{\frac{(b_1+b_2+\cdots+b_k)}{19}}$, so we are looking for the least value of $k$ so that

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2016_AMC_12B_Problems/Problem_25&oldid=76622"