Define the sequence recursively as follows: , , and . How many terms of this sequence are divisible by 2786?
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.
The given recurrence has closed form a n = α 2 n + 1 − β 2 n + 1 , where α = 2 + 1 and β = 2 − 1 . Assume that 2 m + 1 divides 2 n + 1 and let 2 n + 1 = k ( 2 m + 1 ) . Then, we have:
a n = α k ( 2 m + 1 ) − β k ( 2 m + 1 ) = ( α 2 m + 1 − β 2 m + 1 ) S = a m S
where S is a sum of combinations of powers of α and β (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 divides a n . Since 2 7 8 6 = a 4 , we have that a 4 , a 1 3 , a 2 2 , a 3 1 . . . are all divisible by a 4 = 2 7 8 6 .