Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 4.1.19* ($\left \lfloor (1 + \sqrt{3})^{2m+1} \right \rfloor $ is divisible by $2^{m+1}$ but not by $2^{m+2}$)

Exercise 4.1.19* ($\left \lfloor (1 + \sqrt{3})^{2m+1} \right \rfloor $ is divisible by $2^{m+1}$ but not by $2^{m+2}$)

If m 1 , prove that ( 1 + 3 ) 2 m + 1 is divisible by 2 m + 1 but not by 2 m + 2 .

Answers

Proof. Consider the sequence ( u n ) n defined by

u n = ( 1 + 3 ) n + ( 1 3 ) n = ρ 1 n + ρ 2 n , ( n ) ,

where ρ 1 = 1 + 3 , ρ 2 = 1 3 are the roots of the polynomial x 2 2 x 2 .

Then u 0 = u 1 = 2 , and

ρ 1 2 = 2 ρ 1 + 2 , ρ 2 2 = 2 ρ 2 + 2 ,

thus for all n ,

ρ 1 n + 2 = 2 ρ 1 n + 1 + 2 ρ 1 n , ρ 2 n + 2 = 2 ρ 2 n + 1 + 2 ρ 2 n ,

therefore, by adding these two relations, we obtain

u 0 = u 1 = 2 , n , u n + 2 = 2 u n + 1 + 2 u n . (1)

This shows that for all n , u n is an integer.

Suppose that n = 2 m + 1 is odd. Since 1 < 3 < 2 ,

1 < 1 3 < 0 ,

So | 1 3 | < 1 , thus | 1 3 | 2 m + 1 < 1 and ( 1 3 ) 2 m + 1 < 0 , therefore

1 < ( 1 3 ) 2 m + 1 < 0 .

Then ( 1 + 3 ) 2 m + 1 1 < ( 1 + 3 ) 2 m + 1 + ( 1 3 ) 2 m + 1 < ( 1 + 3 ) 2 m + 1 , so

u 2 m + 1 < ( 1 + 3 ) 2 m + 1 < u 2 m + 1 + 1 .

This shows that for all m ,

u 2 m + 1 = ( 1 + 3 ) 2 m + 1 .

After some experiments, we found the following pattern, which we will prove by induction:

𝒫 ( n ) { ν 2 ( u 4 n ) = 2 n + 1 , ν 2 ( u 4 n + 1 ) = 2 n + 1 , ν 2 ( u 4 n + 2 ) = 2 n + 3 , ν 2 ( u 4 n + 3 ) = 2 n + 2 .
  • If n = 0 ,

    u 0 = 2 , u 1 = 2 , u 3 = 8 = 2 3 , u 4 = 20 = 2 2 5 ,

    so

    ν 2 ( u 0 ) = 1 , ν 2 ( u 1 ) = 1 , ν 2 ( u 3 ) = 3 , ν 2 ( u 4 ) = 2 .

    This shows that 𝒫 ( 0 ) is true.

  • Suppose now that 𝒫 ( n ) is true. In particular,

    u 4 n + 2 = 2 2 n + 3 p , u 4 n + 3 = 2 2 n + 2 q ,

    where p , q are odd integers. Then by (1),

    u 4 n + 4 = 2 ( u 4 n + 3 + 2 u 4 n + 2 ) = 2 ( 2 2 n + 3 p + 2 2 n + 2 q ) = 2 2 n + 3 ( 2 p + q ) = 2 2 n + 3 r ,

    where r = 2 p + q is odd. Therefore

    ν 2 ( u 4 n + 4 ) = 2 n + 3 .

    Similarly,

    u 4 n + 5 = 2 ( u 4 n + 4 + u 4 n + 3 ) = 2 ( 2 2 n + 3 r + 2 2 n + 2 q ) = 2 2 n + 3 ( 2 r + q ) = 2 2 n + 3 s ,

    where s = 2 r + q is odd. Therefore

    ν 2 ( u 4 n + 5 ) = 2 n + 3 .

    Now

    u 4 n + 6 = 2 ( u 4 n + 5 + u 4 n + 4 ) = 2 ( 2 2 n + 3 s + 2 2 n + 3 r ) = 2 2 n + 4 ( s + r ) = 2 2 n + 4 t ,

    where t = s + r = ( 2 r + q ) + ( 2 p + q ) = 2 ( r + p + q ) = 2 u , where u = r + p + q is the sum of three odd numbers, so u is odd. Thus

    u 4 n + 6 = 2 2 n + 5 u ,

    where u is odd. Therefore

    ν 2 ( u 4 n + 6 ) = 2 n + 5 .

    Finally

    u 4 n + 7 = 2 ( u 4 n + 6 + u 4 n + 5 ) = 2 ( 2 2 n + 5 u + 2 2 n + 3 s ) = 2 2 m + 4 ( 2 2 u + s ) = 2 2 n + 4 v ,

    where v = 2 2 t + s is odd. Therefore

    ν 2 ( u 4 n + 7 ) = 2 n + 4 .

    To summarize,

    ν 2 ( u 4 n + 4 ) = 2 n + 3 = 2 ( n + 1 ) + 1 , ν 2 ( u 4 n + 5 ) = 2 n + 3 = ( 2 ( n + 1 ) + 1 , ν 2 ( u 4 n + 6 ) = 2 n + 5 = 2 ( n + 1 ) + 3 , ν 2 ( u 4 n + 7 ) = 2 n + 4 = 2 ( n + 1 ) + 2 ,

    so 𝒫 ( n + 1 ) is true when 𝒫 ( n ) is true.

  • The induction is done, so

    n , { ν 2 ( u 4 n ) = 2 n + 1 , ν 2 ( u 4 n + 1 ) = 2 n + 1 , ν 2 ( u 4 n + 2 ) = 2 n + 3 , ν 2 ( u 4 n + 3 ) = 2 n + 2 .

In particular, for all integers m 0 ,

ν 2 ( u 2 m + 1 ) = { ν 2 ( u 4 n + 1 ) = 2 n + 1 = m + 1 if  m = 2 n , ν 2 ( u 4 n + 3 ) = 2 n + 2 = m + 1 if  m = 2 n + 1 .

In both cases,

ν 2 ( ( 1 + 3 ) 2 m + 1 ) = ν 2 ( u 2 m + 1 ) = m + 1 .

If m , ( 1 + 3 ) 2 m + 1 is divisible by 2 m + 1 but not by 2 m + 2 . □

User profile picture
2024-12-16 18:37
Comments