Let and for each positive integer , .
Is it true or false that for infinite many positive integers , is a power of 2?
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.
We proceed inductively. As a base case, note that a 9 = 1 6 = ( 2 2 ) 2 . In particular, a k = ( 2 j ) 2 for some j (in this case, j = 2 ). We now show that, if 2 2 j = ( 2 j ) 2 appears in our sequence, a greater power of two (specifically, ( 2 j + 1 ) 2 ) must also appear in our sequence. To that end, let a n = x 2 for x = 2 j , for some j ≥ 2 . Then, a n + 1 a n + 2 a n + 3 a n + 4 a n + 5 a n + 6 a n + 7 = x 2 + x = a n + 1 + ⌊ a n + 1 ⌋ = x 2 + x + x = x 2 + 2 x = a n + 2 + ⌊ a n + 2 ⌋ = x 2 + 3 x + x = x 2 + 3 x = a n + 3 + ⌊ a n + 3 ⌋ = x 2 + 3 x + ( x + 1 ) = x 2 + 4 x + 1 = a n + 4 + ⌊ a n + 4 ⌋ = x 2 + 4 x + 1 + ( x + 1 ) = x 2 + 5 x + 2 = a n + 5 + ⌊ a n + 5 ⌋ = x 2 + 5 x + ( x + 2 ) = x 2 + 6 x + 4 = a n + 6 + ⌊ a n + 6 ⌋ = x 2 + 6 x + 4 + ( x + 2 ) = x 2 + 7 x + 6 < ( x + 1 ) 2 < ( x + 1 ) 2 > ( x + 1 ) 2 < ( x + 2 ) 2 > ( x + 2 ) 2 < ( x + 3 ) 2 > ( x + 3 ) 2
The inequalities for a n + 5 and a n + 7 hold because x ≥ 4 . This pattern continues for k < 2 x + 1 , with a n + k = { x 2 + k x + ( 2 k − 2 ) 2 x 2 + k x + [ ( 2 k − 3 ) 2 + 2 k − 3 ] k is even k is odd
Let k = 2 x + 1 . Then a n + 2 x + 1 = x 2 + ( 2 x + 1 ) x + [ ( 2 2 x − 2 ) 2 + 2 2 x − 2 ] = x 2 + ( 2 x ) x + x + ( x 2 − 2 x + 1 ) + ( x − 1 ) = x 2 + 2 x 2 + x 2 = ( 2 x ) 2
Since x = 2 j , a n + 2 x + 1 = ( 2 x ) 2 = 2 j + 2 . Thus, there are infinitely a n that are powers of two (specifically, all powers of two with an even exponent will appear in our sequence).