A "simple" divisibility problem

Define the sequence a k a_k recursively as follows: a 0 = 2 a_0 = 2 , a 1 = 14 a_1 = 14 , and a n + 2 = 6 a n + 1 a n a_{n+2} = 6 a_{n+1} - a_n . How many terms of this sequence are divisible by 2786?

2 2786 Infinitely many 1 None

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

Star Fall
Jul 2, 2016

The given recurrence has closed form a n = α 2 n + 1 β 2 n + 1 a_n = \alpha^{2n+1} - \beta^{2n+1} , where α = 2 + 1 \alpha = \sqrt{2} + 1 and β = 2 1 \beta = \sqrt{2} - 1 . Assume that 2 m + 1 2m+1 divides 2 n + 1 2n+1 and let 2 n + 1 = k ( 2 m + 1 ) 2n+1 = k(2m+1) . Then, we have:

a n = α k ( 2 m + 1 ) β k ( 2 m + 1 ) = ( α 2 m + 1 β 2 m + 1 ) S = a m S a_n = \alpha^{k(2m+1)} - \beta^{k(2m+1)} = (\alpha^{2m+1} - \beta^{2m+1}) S = a_m S

where S S is a sum of combinations of powers of α \alpha and β \beta (why?), therefore it is an algebraic integer. On the other hand, it is clearly rational, so it must be a rational integer, and therefore a m a_m divides a n a_n . Since 2786 = a 4 2786 = a_4 , we have that a 4 , a 13 , a 22 , a 31 . . . a_4, a_{13}, a_{22}, a_{31}... are all divisible by a 4 = 2786 a_4 = 2786 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...