2016 AMC 12B Problem 25

a 0 = 1 , a 1 = 2 19 , a n = a n 1 × a n 2 2 \Large a_0 = 1, a_1 = \sqrt[19]{2}, \\ \Large a_n = a_{n-1} \times a_{n-2} ^2

Consider a sequence defined recursively for n 2 n\geq 2 in the above manner.

What is the smallest positive integer value k k such that the product a 1 a 2 a k a_{1}a_{2}\dotsm a_k is an integer?


Check out the whole set: 2016 AMC 12B Problems .
15 16 17 18 19 20

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

William Pan
Apr 23, 2016

Relevant wiki: Induction - Recurrence Relations

First, you start with the first part of the sequence: 1 , 2 19 , 2 19 , 2 3 19 1,\quad \sqrt[19]{2},\quad \sqrt[19]{2},\quad \sqrt[19]{2^3}\dotsm

That's too much to write (for most of us, at least). If you keep going on, the exponent inside the square root is going to get larger and larger. Let's convert this to exponential form.

2 0 , 2 1 19 , 2 1 19 , 2 3 19 , 2 5 19 2^0,\quad 2^{\frac{1}{19}},\quad 2^{\frac{1}{19}},\quad 2^{\frac{3}{19}},\quad 2^{\frac{5}{19}}\dotsm

Still too much to write for most of us. Let's drop out the 2 and list only the exponents. And let's drop out the first term, because we don't need it anyway.

Multiply the exponents by 19 while you're at it. After all this, we get the sequence of:

1 , 1 , 3 , 5 , 11 , 21 , 43 , 85 , 1,\quad 1,\quad 3,\quad 5,\quad 11,\quad 21,\quad 43,\quad 85,\quad \dotsm

To see how many terms of the sequence we need to multiply to get an integer, you must add that many terms of the sequence above and check whether it is divisible by 19. Given the answer choices, you should find out 15 of the terms before you start doing that.

The equations for finding the next terms are:

2 a n + 1 = a n + 1 2a_{n}+1=a_{n+1}\quad for all n n\in the set of all odd numbers.

2 a n 1 = a n + 1 2a_{n}-1=a_{n+1}\quad for all n n\in the set of all even numbers.

To find the sum of all terms before that, use these equations:

i = 1 n = 2 a n 1 \sum \limits_{i=1}^{n} = 2a_{n}-1 for all n n\in the set of all odd numbers.

i = 1 n = 2 a n \sum \limits_{i=1}^{n} = 2a_n for all n n\in the set of all even numbers.

So, we can find the terms of this sequence up to a 20 a_{20} :

1 , 1 , 3 , 5 , 11 , 21 , 43 , 85 , 171 , 341 , 683 , 1365 , 2731 , 5461 , 10923 , 21825 , 43651 , 87301 , 174603 , 349205 1,\quad 1,\quad 3,\quad 5,\quad 11,\quad 21,\quad 43,\quad 85,\quad 171,\quad 341,\quad 683,\quad 1365,\quad 2731,\quad 5461,\quad 10923, \\ 21825,\quad 43651,\quad 87301,\quad 174603,\quad 349205

The sum of the first 15 terms is 2 ( 10923 ) 1 = 21825 2(10923)-1 = 21825 , which is NOT divisible by 19. (The divisibility rule for 19 is to add two times the digit [opposite of 7, which is to subtract] to the remaining number).

The sum of the first 16 terms is 2 ( 21825 ) = 43650 2(21825) = 43650 , which is NOT divisible by 19 (as you saw in the last example).

The sum of the first 17 terms is 2 ( 43651 ) 1 = 87301 2(43651)-1 = 87301 , which IS divisible by 19.

Therefore, 17 is the smallest positive integer, k k .

I too did the same way ;) Cheers.

Samara Simha Reddy - 5 years, 1 month ago

I found it hard to read that the root was 19. I thought it was 10. As such, I've edited the formulas to make them easier to read.

Calvin Lin Staff - 5 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...