So sequence

Algebra Level 3

Let a 1 = 1 a_1=1 and for each positive integer n n , a n + 1 = a n + a n a_{n+1}=a_n+\left \lfloor \sqrt{a_n} \right \rfloor .

Is it true or false that for infinite many positive integers k k , a k a_k is a power of 2?

False True

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

Jordan Cahn
Sep 26, 2018

We proceed inductively. As a base case, note that a 9 = 16 = ( 2 2 ) 2 a_9=16=(2^2)^2 . In particular, a k = ( 2 j ) 2 a_k=(2^{j})^2 for some j j (in this case, j = 2 j=2 ). We now show that, if 2 2 j = ( 2 j ) 2 2^{2j}=(2^j)^2 appears in our sequence, a greater power of two (specifically, ( 2 j + 1 ) 2 (2^{j+1})^2 ) must also appear in our sequence. To that end, let a n = x 2 a_n=x^2 for x = 2 j x=2^j , for some j 2 j\geq 2 . Then, a n + 1 = x 2 + x < ( x + 1 ) 2 a n + 2 = a n + 1 + a n + 1 = x 2 + x + x = x 2 + 2 x < ( x + 1 ) 2 a n + 3 = a n + 2 + a n + 2 = x 2 + 3 x + x = x 2 + 3 x > ( x + 1 ) 2 a n + 4 = a n + 3 + a n + 3 = x 2 + 3 x + ( x + 1 ) = x 2 + 4 x + 1 < ( x + 2 ) 2 a n + 5 = a n + 4 + a n + 4 = x 2 + 4 x + 1 + ( x + 1 ) = x 2 + 5 x + 2 > ( x + 2 ) 2 a n + 6 = a n + 5 + a n + 5 = x 2 + 5 x + ( x + 2 ) = x 2 + 6 x + 4 < ( x + 3 ) 2 a n + 7 = a n + 6 + a n + 6 = x 2 + 6 x + 4 + ( x + 2 ) = x 2 + 7 x + 6 > ( x + 3 ) 2 \begin{aligned} a_{n+1} &= x^2 + x &< (x+1)^2 \\ a_{n+2} &= a_{n+1} + \left\lfloor\sqrt{a_{n+1}}\right\rfloor = x^2 + x + x = x^2 + 2x &< (x+1)^2 \\ a_{n+3} &= a_{n+2} + \left\lfloor\sqrt{a_{n+2}}\right\rfloor = x^2 + 3x + x = x^2 + 3x &> (x+1)^2\\ a_{n+4} &= a_{n+3} + \left\lfloor\sqrt{a_{n+3}}\right\rfloor = x^2 + 3x + (x+1) = x^2 + 4x + 1 &< (x+2)^2\\ a_{n+5} &= a_{n+4} + \left\lfloor\sqrt{a_{n+4}}\right\rfloor = x^2 + 4x + 1 + (x+1) = x^2 + 5x + 2 &> (x+2)^2\\ a_{n+6} &= a_{n+5} + \left\lfloor\sqrt{a_{n+5}}\right\rfloor = x^2 + 5x + (x+2) = x^2 + 6x + 4 &< (x+3)^2\\ a_{n+7} &= a_{n+6} + \left\lfloor\sqrt{a_{n+6}}\right\rfloor = x^2 + 6x + 4 + (x+2) = x^2 + 7x + 6 &> (x+3)^2 \end{aligned}

The inequalities for a n + 5 a_{n+5} and a n + 7 a_{n+7} hold because x 4 x\geq 4 . This pattern continues for k < 2 x + 1 k<2x+1 , with a n + k = { x 2 + k x + ( k 2 2 ) 2 k is even x 2 + k x + [ ( k 3 2 ) 2 + k 3 2 ] k is odd a_{n+k} = \begin{cases} x^2 + kx + (\frac{k-2}{2})^2 & k\text{ is even} \\ x^2 + kx + [(\frac{k-3}{2})^2 + \frac{k-3}{2}] & k\text{ is odd} \end{cases}

Let k = 2 x + 1 k=2x+1 . Then a n + 2 x + 1 = x 2 + ( 2 x + 1 ) x + [ ( 2 x 2 2 ) 2 + 2 x 2 2 ] = x 2 + ( 2 x ) x + x + ( x 2 2 x + 1 ) + ( x 1 ) = x 2 + 2 x 2 + x 2 = ( 2 x ) 2 a_{n+2x+1} = x^2 + (2x+1) x + \left[\left(\frac{2x-2}{2}\right)^2 + \frac{2x-2}{2}\right] = x^2 + (2x)x + x + (x^2-2x+1) + (x-1) = x^2 + 2x^2 + x^2 = (2x)^2

Since x = 2 j x=2^j , a n + 2 x + 1 = ( 2 x ) 2 = 2 j + 2 a_{n+2x+1}=(2x)^2=2^{j+2} . Thus, there are infinitely a n a_n that are powers of two (specifically, all powers of two with an even exponent will appear in our sequence).

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...