Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 5.6.15* (Rational points of the curve $x^3 + y^3 = 9$ in the first quadrant)

Exercise 5.6.15* (Rational points of the curve $x^3 + y^3 = 9$ in the first quadrant)

Let the triple ( X n , Y n , Z n ) of integers be defined as in the proof of Theorem 5.16. Show that infinitely many of the rational points ( X n Z n , Y n Z n ) lie in the first quadrant.

Answers

PIC

Proof. Let the triple ( X n , Y n , Z n ) of integers be defined by ( X 0 , Y 0 , Z 0 ) = ( 2 , 1 , 1 ) and

{ X n + 1 = X n ( X n 3 + 2 Y n 3 ) , Y n + 1 = Y n ( 2 X n 3 + Y n 3 ) , Z n + 1 = Z n ( X n 3 Y n 3 ) . (1)

Then X n 3 + Y n 3 = 9 Z n 3 (see Theorem 5.16 and Problem 14). Since Z n is odd by the proof of Theorem 5.16, Z n 0 for every n .

Put x n = X n Z n , y n = Y n Z n for all n . Then ( x n , y n ) is a rational point on the curve x 3 + y 3 = 9 , and

{ x n + 1 = x n ( x n 3 + 2 y n 3 ) x n 3 y n 3 , y n + 1 = y n ( 2 x n 3 + y n 3 ) x n 3 y n 3 . (2)

Note that x n = 0 is impossible, otherwise there is a first n for which x n = 0 . Since x 0 = 2 , it follows that n > 0 . Then X n = 0 , but X n 1 0 , and 0 = X n = X n 1 ( X n 1 3 + 2 Y n 1 3 ) , so X n 1 3 + 2 Y n 1 3 = 0 , which gives Y n 1 X n 1 = 1 2 3 . But 2 3 is an irrational number. This contradiction proves that x n 0 for all n , and similarly y n 0 .

Since x n 3 + y n 3 = 9 , x n and y n cannot be both negative, therefore ( x n , y n ) lie in the first quadrant if and only if y n x n > 0 . Put m n = y n x n . By (2),

m n + 1 = m n 2 + m n 3 1 + 2 m n 3 ,

so, m 0 = 1 2 , and for all n , m n + 1 = h ( m n ) , where

h ( x ) = x 2 + x 3 1 + 2 x 3 .

PIC

We are led to study the recurrent sequence ( m n ) n , and to prove that m n > 0 for infinity many indices n . For all x { a } , where a = 1 2 3 ,

h ( x ) = 2 ( x 2 + x + 1 ) 2 ( x 1 ) 2 ( 2 x 3 + 1 ) 2 0 ,

and h ( x ) = 0 x = 1 . Therefore h is strictly decreasing on ] , a [ and on ] a , + [ . Moreover

h ( x ) > 0 x ] , b [ ] a , 0 [ ( where  b = 2 3 < a = 1 2 3 < 0 ) , (3)  h ( x ) < 0 x ] b , a [ ] 0 , + [ . (4) 

(see figure).

Since h ( x ) = x x = 0 or x = 1 , h has two fixed points 0 and 1 , which are repulsive because h ( 0 ) = 2 and h ( 1 ) = 8 (this explains that the sequence ( m n ) n is very chaotic).

Note that for every n , m n 0 , because y n 0 . Let n be any positive integer. We want to prove that there is an index n + k n such that m n + k > 0 . For this purpose, assume for the sake of contradiction that for all k 0 , m n + k < 0 .

Since m n + k < 0 and f ( m n + k ) = m n + k + 1 < 0 , we obtain using (4):

k , m n + k I = ] b , a [ = ] 2 3 , 1 2 3 [ .

But h is defined and decreasing on I . We prove by induction on k that the sequence ( m n + 2 k ) k is monotonic (note that ( h h ) ( m n + 2 k ) = m n + 2 k + 2 ).

Indeed, if m n m n + 2 , then the proposition 𝒫 ( k ) : m n + 2 k m n + 2 k + 2 is true for k = 0 . If 𝒫 ( k ) is true for some k , then

m n + 2 k m n + 2 k + 2 h ( m n + 2 k ) h ( m n + 2 k ) ( h h ) ( m n + 2 k ) ( h h ) ( m n + 2 k ) m n + 2 k + 2 m n + 2 k + 4 ,

so 𝒫 ( k + 1 ) is true. This shows that for all n , m n + 2 k m n + 2 ( k + 1 ) , so the sequence ( m n + 2 k ) k is increasing.

Similarly, if m n m n + 2 , then ( m n + 2 k ) k is decreasing. In both cases, the sequence ( m n + 2 k ) k is monotonic.

The sequence ( m n + 2 k ) k is monotonic, and bounded (because m n + k [ b , a [ ), therefore convergent. Let l = lim k m n + 2 k . Then l [ b , a ] .

  • If l = a , then lim k | h ( m n + 2 k ) | = , thus lim k | ( h h ) ( m n + 2 k ) | = 0 , so lim k m n + 2 k + 2 = 0 . Since ( m n + 2 k + 2 ) is a sequence extracted from ( m n + 2 k ) , they have same limit, thus a = 0 . This is false, therefore l a .
  • Since l a , then l [ a , b [ , thus h is continuous at the point l , therefore

    ( h h ) ( l ) = lim k ( h h ) ( m n + 2 k ) = lim k m n + 2 k + 2 = l ,

    so l is a fixed point of h h .

    0 = ( h h ) ( x ) x = 3 ( x 4 + 2 x 3 x + 1 ) ( x 4 x 3 + 3 x 2 x + 1 ) ( x 4 x 3 + 2 x + 1 ) ( x 2 x + 1 ) ( x + 1 ) x ( 2 x 12 + 4 x 9 + 12 x 6 + 10 x 3 1 ) ( 2 x 3 + 1 ) x = 0  or  x = 1 ,

    since none of the polynomials x 4 + 2 x 3 x + 1 , x 4 x 3 + 3 x 2 x + 1 , x 4 x 3 + 2 x + 1 , x 2 x + 1 has a real solution. So the fixed points of h h are the fixed points of h .

Since 0 [ b , a ] , it remains only the possibility

lim k m n + 2 k = 1 .

This would be possible if m n + 2 k = 1 for some k . But if m p = 1 for some index p then y p = x p . This is impossible, because 9 = x p 3 + y p 3 0 . Therefore for all k ,

m n + 2 k 1 .

The contradiction follows from | h ( 1 ) | = 8 > 1 , thus ( h h ) ( 1 ) = h ( h ( 1 ) ) h ( 1 ) = ( h ( 1 ) ) 2 = 64 > 1 . Since h is continuous at the point 1 , there is some α > 0 such that [ 1 α , 1 + α ] ] b , a [ and

x [ 1 α , 1 + α ] , ( h h ) ( x ) 2 .

Since lim k m n + 2 k = 1 , there is an integer N > 0 such that

k N , m n + 2 k [ 1 α , 1 + α ] .

By the Mean Value Theorem, there is some c [ 1 α , 1 + α ] such that

| ( f f ) ( m n + 2 k ) ( f f ) ( 1 ) | = | ( f f ) ( c ) | | m n + 2 k ( 1 ) | 2 | m n + 2 k ( 1 ) | ,

therefore

| m n + 2 k + 2 + 1 | 2 | m n + 2 k + 1 | , ( k N ) .

By induction, this implies

| m n + 2 N + 2 k + 1 | 2 k | m n + 2 N + 1 |

We have proved that m n + 2 N 1 , thus lim k 2 k | m n + 2 N + 1 | = + , so lim k | m n + 2 N + 2 k + 1 | = + , but lim k | m n + 2 N + 2 k + 1 | = 0 . This is a contradiction, which proves that

n , k 0 , m n + k > 0 .

Therefore infinitely many of the rational points ( X n Z n , Y n Z n ) lie in the first quadrant. □

Note: If m n is close to 1 , we can wait a long time before m n + k > 0 , but this necessarily happens, and then ( x n + k , y n + k ) is in the first quadrant.

User profile picture
2025-05-14 11:23
Comments