The sequence is given by and for .
Find the smallest integer such that is an integer.
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.
Given that 5 a n + 1 − a n = 3 n + 2 3 + 1 , we have:
5 a n 5 a n + 1 b n + 1 ⟹ b 2 b 3 b 4 = 3 n + 2 3 + 1 = ( 3 n + 2 3 + 1 ) b n = ( 3 + 2 3 + 1 ) 5 1 = 3 + 5 = 8 = ( 8 3 + 1 ) 8 = 3 + 8 = 1 1 = ( 1 1 3 + 1 ) 1 1 = 3 + 1 1 = 1 4 Let b k = 5 a k
Therefore, it would appears that b n = 3 ( n − 1 ) + 5 = 3 n + 2 , which can be easily proven by induction , because b n + 1 = ( 3 n + 2 3 + 1 ) b n = ( 3 n + 2 3 + 1 ) ( 3 n + 2 ) = 3 + 3 n + 2 = 3 ( n + 1 ) + 2 .
Since b m = 5 a m , for a m to be an integer, b m = 3 m + 2 must be a power of 5 . 3 m + 2 = 5 1 is when m = 1 . For higher power of 5 , 3 m + 2 ≡ 0 (mod 25) ⟹ m ≡ 4 1 .