Skip to main content

On some Diophantine equations

Abstract

We consider the sequences ( u n ) and ( v n ) which are the generalizations of Fibonacci and Lucas sequences, respectively. Then we determine some identities involving these generalized sequences to present all solutions of the equations

and

x 2 ( p 2 4 ) u n xy ( p 2 4 ) y 2 = v n 2 ,

for p3 and a square-free integer p 2 4. In addition to these, all solutions of some different Diophantine equations such as x 2 v 2 n xy+ y 2 =( p 2 4) u n 2 , x 2 v n xy+ y 2 =( p 2 4), x 2 v n xy+ y 2 =1, x 2 v 2 n xy+ y 2 = u n 2 , x 2 v 2 n xy+ y 2 = v n 2 , x 2 ( p 2 4) u n xy( p 2 4) y 2 =1 are identified, by using divisibility rules of the sequences ( u n ) and ( v n ).

MSC:11B37, 11B39, 11C20, 11D09, 11D45.

1 Introduction

In this paper, we consider the generalized Fibonacci sequence ( u n ) and the generalized Lucas sequence ( v n ). Let p3 be an integer. For any n2, ( u n ) is defined by the recurrence relation u n =p u n 1 u n 2 with the initial conditions u 0 =0, u 1 =1. The generalized Lucas sequence ( v n ) is defined by the recurrence relation v n =p v n 1 v n 2 for any n2 with the initial conditions v 0 =2 and v 1 =p. The terms u n and v n are called the n th generalized Fibonacci and Lucas numbers, respectively.

Moreover, generalized Fibonacci and Lucas numbers can be extended to negative indices. In general, for all nN, u n = u n and v n = v n . Furthermore it is known that v n = u n + 1 u n 1 . For more detailed information about these sequences, one can consult [15] and [6].

In [3], McDaniel showed that the solutions of the equation x 2 ( p 2 4) y 2 =4 are given by (x,y)=( v n , u n ) with n1. Moreover, in [79] and [10], Jones investigated whether the equations x 2 ( p 2 4) y 2 =4, x 2 ( p 2 1) y 2 =4, x 2 ( p 2 1) y 2 =1 and x 2 ( p 2 4) y 2 =1 have solutions or not. In his proofs, he used Fermat’s method of infinite descent.

In [11], Demirtürk and Keskin determined all solutions of the known Diophantine equations x 2 L n xy y 2 =1, x 2 L n xy+ ( 1 ) n y 2 =5 and new Diophantine equations

and

x 2 L 2 n xy+ y 2 =5 L n 2 .

In this paper, our main purpose is to determine all (x,y) solutions of the Diophantine equations

x 2 +axy+b y 2 =c,

where a, b, c are generalized Fibonacci and generalized Lucas numbers. These equations can be listed as follows:

and

x 2 ( p 2 4 ) u n xy ( p 2 4 ) y 2 =1.

2 Divisibility rules of sequences ( u n ) and ( v n )

In this section, we recall some divisibility rules related to generalized Fibonacci and Lucas sequences ( u n ) and ( v n ). Since these rules are proved in [1216], we omit their proofs. Using these divisibility rules, in the last section, we will find all solutions of Diophantine equations mentioned above.

Theorem 1 Let m,nN. Then v n | u m if and only if n|m and m/n is an even integer.

Theorem 2 Let m,nN. Then u n | u m if and only if n|m.

Theorem 3 Let m,nN. Then v n | v m if and only if n|m and m/n is an odd integer.

Theorem 4 Let m,nN and n>1. Then u n | v m if and only if n=2 and m is an odd integer.

3 Some identities of the sequences ( u n ) and ( v n )

In this section, we obtain some identities by using special matrices including generalized Fibonacci and Lucas numbers.

Now we compile some identities to use in the proofs of the following theorems. These identities can be found in [5, 17, 18] and [19].

(3.1)
(3.2)
(3.3)
(3.4)
(3.5)
(3.6)
(3.7)
(3.8)
(3.9)
(3.10)
(3.11)

for all m,nZ.

Theorem 5

v n + m 2 ( p 2 4 ) u n t v n + m u m + t ( p 2 4 ) u m + t 2 = v n t 2 ,

for all m,n,tZ.

Proof If we consider identities (3.6) and (3.7), then the matrix multiplication

[ v n / 2 ( p 2 4 ) u n / 2 u t / 2 v t / 2 ][ v m u m ]=[ v n + m u m + t ]

can be written. By identity (3.4), we get

[ v m u m ]= [ v n / 2 ( p 2 4 ) u n / 2 u t / 2 v t / 2 ] 1 [ v n + m u m + t ]= 2 v n t [ v t / 2 ( p 2 4 ) u n / 2 u t / 2 v n / 2 ][ v n + m u m + t ],

since

| v n / 2 ( p 2 4 ) u n / 2 u t / 2 v t / 2 |= v n v t ( p 2 4 ) u n u t 4 = v n t 2 0.

Thus, it follows that

v m = v t v n + m ( p 2 4 ) u n u m + t v n t

and

u m = v n u m + t u t v n + m v n t .

Since v m 2 ( p 2 4) u m 2 =4, we have

( v t v n + m ( p 2 4 ) u n u m + t ) 2 ( p 2 4 ) ( v n u m + t u t v n + m ) 2 =4 v n t 2 .

Therefore, we obtain ( v t 2 ( p 2 4) u t 2 ) v n + m 2 2( p 2 4)( v t u n v n u t ) v n + m u m + t ( p 2 4)( v n 2 ( p 2 4) u n 2 ) u m + t 2 =4 v n t 2 . By using (3.3) and (3.10) in this equation, it is seen that

4 v n + m 2 4 ( p 2 4 ) u n t v n + m u m + t 4 ( p 2 4 ) u m + t 2 =4 v n t 2 .

Thus, we get

v n + m 2 ( p 2 4 ) u n t v n + m u m + t ( p 2 4 ) u m + t 2 = v n t 2 .
(3.12)

 □

Theorem 6 Let m,n,tZ and tn. Then

v n + m 2 v n t v n + m v m + t + v m + t 2 = ( p 2 4 ) u n t 2 .

Proof By using (3.6), we can consider the matrix multiplication

[ v n / 2 ( p 2 4 ) u n / 2 v t / 2 ( p 2 4 ) u t / 2 ][ v m u m ]=[ v n + m v m + t ].

Since tn, we get

| v n / 2 ( p 2 4 ) u n / 2 v t / 2 ( p 2 4 ) u t / 2 |= ( p 2 4 ) ( v n u t v t u n ) 4 = ( p 2 4 ) u n t 2 0,

by (3.3). Therefore, we have

[ v m u m ] = [ v n / 2 ( p 2 4 ) u n / 2 v t / 2 ( p 2 4 ) u t / 2 ] 1 [ v n + m v m + t ] = 2 ( p 2 4 ) u n t [ ( p 2 4 ) u t / 2 ( p 2 4 ) u n / 2 v t / 2 v n / 2 ] [ v n + m v m + t ] .

Thus, it follows that

v m = u t v n + m u n v m + t u n t

and

u m = v n v m + t v t v n + m ( p 2 4 ) u n t .

Since v m 2 ( p 2 4) u m 2 =4, we get

( p 2 4 ) ( u t v n + m u n v m + t ) 2 ( v n v m + t v t v n + m ) 2 =4 ( p 2 4 ) u n t 2 .

Hence, it is seen that ( v t 2 ( p 2 4) u t 2 ) v n + m 2 +2( v n v t ( p 2 4) u t u n ) v n + m v m + t ( v n 2 ( p 2 4) u n 2 ) v m + t 2 =4( p 2 4) u n t 2 . By using identities (3.4) and (3.10), we obtain

4 v n + m 2 4 v n t v n + m v m + t +4 v m + t 2 =4 ( p 2 4 ) u n t 2 ,

that is,

v n + m 2 v n t v n + m v m + t + v m + t 2 = ( p 2 4 ) u n t 2 .
(3.13)

 □

Using (3.7) and the matrix multiplication

[ u n / 2 v n / 2 u t / 2 v t / 2 ][ v m u m ]=[ u n + m u m + t ],

we can give the following theorem.

Theorem 7 Let m,n,tZ and tn. Then

u n + m 2 v n t u n + m u m + t + u m + t 2 = u n t 2 .
(3.14)

4 Solutions of some Diophantine equations

In [4], Melham proved that all solutions of the equations y 2 v m xy+ x 2 = u m 2 are (x,y)=( u n , u n + m ) with nZ. Moreover, he showed that if mZ and p 2 4 is a square-free integer, then all solutions of the equation y 2 v m xy+ x 2 =( p 2 4) u m 2 are given by (x,y)=( v n , v n + m ) with nZ. These theorems of Melham are generalized forms of the theorems given in [3], by McDaniel. In [2], Kılıç and Ömür examined more general situations of the conics that McDaniel and Melham dealt in [3] and [4], respectively.

In this section, using the identities given in (3.13) and (3.14), we will obtain all solutions of the equations

x 2 v n xy+ y 2 = ( p 2 4 ) u n 2

and

x 2 v n xy+ y 2 = u n 2

with n1, p3 and p 2 4 is a square-free integer. The solutions of these equations were explored by Kimberling, McDaniel and Melham, respectively in [3, 20] and [4], but we will give different proofs of them here. Moreover, for p3, we will obtain all solutions of the Diophantine equation

x 2 ( p 2 4 ) u n xy ( p 2 4 ) y 2 = v n 2 ,

by using (3.12). Subsequently, if p3 and p 2 4 is a square-free integer, then we will find all solutions of Diophantine equations

x 2 v 2 n xy+ y 2 = ( p 2 4 ) u n 2

and

x 2 v n xy+ y 2 = ( p 2 4 ) .

Moreover, all solutions of the equations

x 2 v n xy+ y 2 =1, x 2 v 2 n xy+ y 2 = u n 2

and

x 2 v 2 n xy+ y 2 = v n 2

will be determined. Addition to this, if p3, then all solutions of the equation

x 2 ( p 2 4 ) u n xy ( p 2 4 ) y 2 =1

will be found.

Now we will remind some Diophantine equations with their solutions. The solutions of these equations are explored in [3] and [6]. We will use these equations for determining all solutions of other Diophantine equations.

Theorem 8 Let p>3. All solutions of the equation x 2 pxy+ y 2 =1 are given by (x,y)=( u m , u m 1 ) with mZ.

Since Corollary 1 can be seen from Theorem 8 and Corollary 2 is stated in [10], we will give them without proof.

Corollary 1 All solutions of the equation x 2 3xy+ y 2 =1 are given by (x,y)=( F 2 m + 2 , F 2 m ) with mZ.

Corollary 2 Let p>3. All nonnegative solutions of the equation u 2 ( p 2 4) v 2 =4 are given by (u,v)=( v m , u m ) with m1.

Theorem 9 and Theorem 10 are stated in [21], so will give them without proof.

Theorem 9 Let p>3. Then the equation x 2 pxy+ y 2 =1 has no solutions.

Theorem 10 All solutions of the equation x 2 3xy+ y 2 =1 are given by (x,y)=( F 2 m + 1 , F 2 m 1 ) with mZ.

From now on we will assume that n is an integer such that n1.

Theorem 11 If p3, then all solutions of the equation x 2 ( p 2 4) u n xy( p 2 4) y 2 = v n 2 are given by (x,y)=( v n + m , u m ) with mZ.

Proof Assume that x 2 ( p 2 4) u n xy( p 2 4) y 2 = v n 2 for some integers x and y. Hence, we can write

( 2 x ( p 2 4 ) u n y ) 2 ( ( p 2 4 ) 2 u n 2 + 4 ( p 2 4 ) ) y 2 =4 v n 2 .

Thus, it follows that ( 2 x ( p 2 4 ) u n y ) 2 ( p 2 4)(( p 2 4) u n 2 +4) y 2 =4 v n 2 . By using (3.10) in this equation, we get ( 2 x ( p 2 4 ) u n y ) 2 ( p 2 4) v n 2 y 2 =4 v n 2 . Therefore it can be seen that v n |2x( p 2 4) u n y. Then taking

u= ( ( 2 x ( p 2 4 ) u n y ) v n + p y ) 2 andv=y,

we obtain u=(x+ v n 1 y)/ v n , by (3.9). From here we get

u 2 p u v + v 2 = ( ( x + v n 1 y ) / v n ) 2 p ( ( x v n 1 y ) / v n ) y + y 2 = ( x 2 ( v n + 1 v n 1 ) x y + y 2 ( v n 2 p v n v n 1 + v n 1 2 ) ) / v n 2 .

Hence, it follows that

u 2 puv+ v 2 = ( x 2 ( p 2 4 ) u n x y ( p 2 4 ) y 2 ) / v n 2 = v n 2 / v n 2 =1,

by using (3.2) and (3.9). From Theorem 8, we obtain (u,v)=( u m + 1 , u m ) for some mZ. Thus, it is seen that

(x+ v n 1 y)/ v n = u m + 1 andy= u m ,

so we get x=( u m + 1 v n v n 1 u m ) and y= u m . Now using (3.11), we obtain

(x,y)=( v n + m , u m ).

Conversely, if (x,y)=( v n + m , u m ) with mZ, then it can be seen that x 2 ( p 2 4) u n xy( p 2 4) y 2 = v n 2 , by (3.12). □

Using Theorem 9 in the same manner with Theorem 11, the following corollary can be given.

Corollary 3 If p>3, then the equation x 2 ( p 2 4) u n xy( p 2 4) y 2 = v n 2 has no solutions.

Proof Assume that x 2 ( p 2 4) u n xy( p 2 4) y 2 = v n 2 for some integers x and y. Similar with the proof of Theorem 11, taking u=(x+ v n 1 y)/ v n and v=y, it can be seen that

u 2 puv+ v 2 = ( x 2 ( p 2 4 ) u n x y ( p 2 4 ) y 2 ) / v n 2 = v n 2 / v n 2 =1,

which is impossible by Theorem 9. Thus, it follows that the equation x 2 ( p 2 4) u n xy( p 2 4) y 2 = v n 2 has no integer solutions. □

The following corollary is a result of Theorem 11. Since it is proved in [11], we will give it without proof.

Corollary 4 All solutions of the equation x 2 5 F 2 n xy5 y 2 = L 2 n 2 are given by (x,y)=( L 2 n + 2 m + 1 , F 2 m + 1 ) with mZ.

Theorem 12 and Theorem 13 are stated by Melham, Kılıç and Ömür without proof in [4] and [2], respectively. Now we will prove them.

Theorem 12 Let p3 and p 2 4 be a square-free integer. Then all solutions of the equation x 2 v n xy+ y 2 =( p 2 4) u n 2 are given by (x,y)=( v n + m , v m ) with mZ.

Proof Assume that x 2 v n xy+ y 2 =( p 2 4) u n 2 for some integers x and y. Then multiplying both sides of this equation by 4 and using (3.10), we get ( 2 x v n y ) 2 ( p 2 4) u n 2 y 2 =4( p 2 4) u n 2 . Since p 2 4 is square-free, it follows that u n |2x v n y. Therefore, there is an integer z such that 2x v n y= u n z. From here we get ( u n z ) 2 ( p 2 4) u n 2 y 2 =4( p 2 4) u n 2 , and then z 2 ( p 2 4) y 2 =4( p 2 4). This implies that ( p 2 4)|z. Then there is an integer a such that z=( p 2 4)a, and we have 2x v n y=( p 2 4) u n a. Thus, it follows that

y 2 ( p 2 4 ) a 2 =4.

Since

y 2 p 2 a 2 =4+4 a 2 ,

we have y 2 p 2 a 2 is even. Then we can see that y and pa have the same parity. Taking u=(y+pa)/2 and v=a, we obtain

u= y + p ( 2 x v n y ( p 2 4 ) u n ) 2 = 2 p x + ( ( p 2 4 ) u n p v n ) y 2 ( p 2 4 ) u n = p x v n 1 y ( p 2 4 ) u n

and

v= 2 x v n y ( p 2 4 ) u n .

Hence, we get

u 2 p u v + v 2 = ( p x v n 1 y ( p 2 4 ) u n ) 2 p ( p x v n 1 y ( p 2 4 ) u n ) ( 2 x v n y ( p 2 4 ) u n ) + ( 2 x v n y ( p 2 4 ) u n ) 2 = ( p 2 4 ) ( x 2 v n x y + y 2 ) / ( p 2 4 ) 2 u n 2 = 1 .

Therefore it follows that (u,v)=( u m + 1 , u m ) with mZ from Theorem 8. Thus, we obtain

(px v n 1 y)/ ( p 2 4 ) u n = u m + 1 and(2x v n y)/ ( p 2 4 ) u n = u m .
(4.1)

Using the identities (3.6), (3.8) and (3.9) in (4.1), we get (x,y)=( v n + m , v m ).

Conversely, if (x,y)=( v n + m , v m ), then it follows that x 2 v n xy+ y 2 =( p 2 4) u n 2 , by (3.13). □

Using Theorem 9 in the same manner with Theorem 12, we can give the following corollary.

Corollary 5 Let p>3 and p 2 4 be a square-free integer. Then the equation x 2 v n xy+ y 2 =( p 2 4) u n 2 has no solutions.

We can give the following corollary from Corollary 5.

Corollary 6 Let p>3 and p 2 4 be a square-free integer. Then the equation x 2 v n xy+ y 2 =( p 2 4) has no solutions.

When p=3, the equation x 2 v n xy+ y 2 =( p 2 4) u n 2 has solutions. In this case we have the equation x 2 L 2 n xy+ y 2 =5 F 2 n 2 . Now we can give all solutions of these equations in the following lemma. Since this lemma is proved in [11], we will give it without proof.

Lemma 1 All solutions of the equation x 2 L 2 n xy+ y 2 =5 F 2 n 2 are given by (x,y)=( L 2 n + 2 m + 1 , L 2 m + 1 ) with mZ.

Theorem 13 All solutions of the equation x 2 v n xy+ y 2 = u n 2 are given by (x,y)=( u n + m , u m ) with mZ.

Proof Suppose that x 2 v n xy+ y 2 = u n 2 for some integers x and y. Completing the square gives ( 2 x v n y ) 2 ( p 2 4) u n 2 y 2 =4 u n 2 , and it is seen that u n |2x v n y. Thus, it follows that

( ( 2 x v n y ) / u n ) 2 ( p 2 4 ) y 2 =4.

Taking u=(((2x v n y)/ u n )+py)/2=(x+ u n 1 y)/ u n and v=y, we have u 2 puv+ v 2 =1. Therefore, from Theorem 8, we get (u,v)=( u m + 1 , u m ) with mZ. From here, we obtain (x,y)=( u n u m + 1 u n 1 u m , u m ). Then by (3.5), it follows that (x,y)=( u n + m , u m ).

Conversely, if (x,y)=( u n + m , u m ), then it can be seen that x 2 v n xy+ y 2 = u n 2 , by (3.14). □

Using Theorem 9 in the same manner with Theorem 13, we can give the following corollaries.

Corollary 7 The equation x 2 v n xy+ y 2 = u n 2 has no solutions.

The following corollary is a generalized form of Theorem 10. Since it is proved in [11], we will give it without proof.

Corollary 8 All solutions of the equation x 2 L 2 n xy+ y 2 = F 2 n 2 are given by (x,y)=( F 2 n + 2 m + 1 , F 2 m + 1 ) with mZ.

Now, let us examine all solutions of the following equations by using Diophantine equations given in Theorem 11, Theorem 12, Theorem 13 and the divisibility rules of the sequences ( u n ) and ( v n ).

Theorem 14 All solutions of the equation x 2 v n xy+ y 2 =1 are given by (x,y)=( u ( t + 1 ) n / u n , u t n / u n ) with tZ.

Proof Assume that x 2 v n xy+ y 2 =1 for some integers x and y. Multiplying both sides of this equation by u n 2 , we get

( u n x ) 2 v n ( u n x)( u n y)+ ( u n y ) 2 = u n 2 .

From Theorem 13, it follows that u n x= u n + m and u n y= u m for some integer m. Hence, we get x= u n + m / u n and y= u m / u n . Since x and y are integers, it is clear that n|m. Therefore, it follows that m=tn for some tZ. Then we obtain

(x,y)=( u ( t + 1 ) n / u n , u t n / u n ).

Conversely, if (x,y)=( u ( t + 1 ) n / u n , u t n / u n ) with tZ, then it follows that x 2 v n xy+ y 2 =1, by (3.14). □

Multiplying both sides of the equation x 2 v n xy+ y 2 =1 by u n 2 and using Corollary 7, the following corollary can be given.

Corollary 9 The equation x 2 v n xy+ y 2 =1 has no solutions.

Theorem 15 If p3, then all solutions of the equation x 2 ( p 2 4) u n xy( p 2 4) y 2 =1 are given by (x,y)=( v ( 2 t + 1 ) n / v n , u 2 t n / v n ) with tZ.

Proof Assume that x 2 ( p 2 4) u n xy( p 2 4) y 2 =1 for some integers x and y. Multiplying both sides of this equation by v n 2 , we get

( v n x ) 2 ( p 2 4 ) u n ( v n x)( v n y) ( p 2 4 ) ( v n y ) 2 = v n 2 .

Thus, it follows that v n x= v n + m and u n y= u m according to Theorem 11. Hence, we get (x,y)=( v n + m / v n , u m / v n ). From Theorem 1 and Theorem 3, it can be seen that n|m and m/n is an even integer. This implies that m=2tn for some tZ. Therefore, we obtain (x,y)=( v ( 2 t + 1 ) n / v n , u 2 t n / v n ).

Conversely, if (x,y)=( v ( 2 t + 1 ) n / v n , u 2 t n / v n ) for some tZ, then it follows that x 2 ( p 2 4) u n xy( p 2 4) y 2 =1, by (3.12). □

The following corollary can be given from Corollary 3.

Corollary 10 If p3, then the equation x 2 ( p 2 4) u n xy( p 2 4) y 2 =1 has no solutions.

Theorem 16 If p3 and p 2 4 is a square-free integer, then all solutions of the equation x 2 v 2 n xy+ y 2 =( p 2 4) u n 2 are given by (x,y)=( v ( 2 t + 3 ) n / v n , v ( 2 t + 1 ) n / v n ) with tZ.

Proof Suppose that x 2 v 2 n xy+ y 2 =( p 2 4) u n 2 for some integers x and y. Multiplying both sides of this equation by v n 2 and considering the fact that u 2 n = u n v n , we get

( v n x ) 2 v 2 n ( v n x)( v n y)+ ( v n y ) 2 = ( p 2 4 ) u 2 n 2 .

From Theorem 12, it follows that v n x= v 2 n + m and v n y= v m . Hence we get (x,y)=( v 2 n + m / v n , v m / v n ). Moreover, since x and y are integers, it follows that n|m and m/n is an odd integer from Theorem 3. Then there is an integer t such that m=(2t+1)n. Therefore, we obtain (x,y)=( v ( 2 t + 3 ) n / v n , v ( 2 t + 1 ) n / v n ).

Conversely, if (x,y)=( v ( 2 t + 3 ) n / v n , v ( 2 t + 1 ) n / v n ) for some tZ, then it follows that x 2 v 2 n xy+ y 2 =( p 2 4) u n 2 , by (3.13). □

The following corollary can be proved similar to Theorem 16, by using Corollary 5. So, we omit its proof.

Corollary 11 If p>3 and p 2 4 is a square-free integer, then the equation x 2 v 2 n xy+ y 2 =( p 2 4) u n 2 has no solutions.

Theorem 17 All solutions of the equations x 2 v 2 n xy+ y 2 = u n 2 and x 2 v 2 n xy+ y 2 = v n 2 are given by (x,y)=( u ( 2 t + 2 ) n / v n , u 2 t n / v n ) and (x,y)=( u ( t + 2 ) n / u n , u t n / u n ) with tZ, respectively.

Proof Assume that x 2 v 2 n xy+ y 2 = u n 2 for some integers x and y. Multiplying both sides of this equation by v n 2 , we get

( v n x ) 2 v 2 n ( v n x)( v n y)+ ( v n y ) 2 = u 2 n 2 .

Then from Theorem 13, it follows that (x,y)=( u 2 n + m / v n , u m / v n ) for some mZ. Hence, using Theorem 1 it is seen that n|m and m/n is an even integer. Thus, we have m=2tn for some tZ. Therefore, (x,y)=( u ( 2 t + 2 ) n / v n , u 2 t n / v n ).

Conversely, if (x,y)=( u ( 2 t + 2 ) n / v n , u 2 t n / v n ) for some tZ, then by (3.14) it follows that x 2 v 2 n xy+ y 2 = u n 2 .

Now suppose that x 2 v 2 n xy+ y 2 = v n 2 for some integers x and y. Multiplying both sides of this equation by u n 2 and considering Theorem 13, we get (x,y)=( u 2 n + m / u n , u m / u n ) for some mZ. Furthermore, since x andy are integers, it follows that n|m from Theorem 2. Then we have m=tn for some tZ. Thus, we obtain (x,y)=( u ( t + 2 ) n / u n , u t n / u n ).

Conversely, if (x,y)=( u ( t + 2 ) n / u n , u t n / u n ), then by (3.14) it follows that x 2 v 2 n xy+ y 2 = v n 2 . □

The proof of the following corollary is similar to that of Theorem 17, by using Corollary 7. So, we omit its proof.

Corollary 12 The equations x 2 L 4 n xy+ y 2 = F 2 n 2 and x 2 L 4 n xy+ y 2 = L 2 n 2 have no solutions.

Theorem 18 Let p3, p 2 4 be a square-free integer. If n>2, then the equation x 2 v n xy+ y 2 =( p 2 4) has no solutions and all solutions of the equation x 2 ( p 2 2)xy+ y 2 =( p 2 4) are given by (x,y)=( v 2 t + 3 p , v 2 t + 1 p ) with tZ.

Proof Assume that x 2 v n xy+ y 2 =( p 2 4) for some integers x and y. Multiplying both sides of this equation by u n 2 , we get

( u n x ) 2 v n ( u n x)( u n y)+ ( u n y ) 2 = ( p 2 4 ) u n 2 .

From Theorem 12, it follows that (x,y)=( v n + m / u n , v m / u n ) with mZ. If n>2, then u n v m from Theorem 4. Therefore, the equation x 2 v n xy+ y 2 =( p 2 4) has no solutions. If n=2, then we get that all solutions of the equation x 2 ( p 2 2)xy+ y 2 =( p 2 4) are given by (x,y)=( v m + 2 / u 2 , v m / u 2 ) with mZ. Hence, it is seen that m is an odd integer according to Theorem 4. Thus, m=2t+1 for some tZ. Therefore, it follows that (x,y)=( v 2 t + 3 p , v 2 t + 1 p ). □

References

  1. Keskin, R, Demirtürk, B: Solutions of some Diophantine equations using generalized Fibonacci and Lucas sequences. Ars Comb. 110 July (2013)

    Google Scholar 

  2. Kılıç E, Ömür N: Conics characterizing the generalized Fibonacci and Lucas sequences with indices in arithmetic progressions. Ars Comb. 2010, 94: 459–464.

    Google Scholar 

  3. McDaniel WL: Diophantine representation of Lucas sequences. Fibonacci Q. 1995, 33: 58–63.

    MathSciNet  Google Scholar 

  4. Melham R: Conics which characterize certain Lucas sequences. Fibonacci Q. 1997, 35: 248–251.

    MathSciNet  Google Scholar 

  5. Rabinowitz S: Algorithmic manipulation of Fibonacci identities. 6. In Applications of Fibonacci Numbers. Kluwer Academic, Dordrect; 1996:389–408.

    Chapter  Google Scholar 

  6. Zhiwei S:Singlefold, Diophantine representation of the sequence u 0 =0, u 1 =1 and u n + 2 =m u n + 1 + u n . In Pure and Applied Logic. Beijing Univ. Press, Beijing; 1992:97–101.

    Google Scholar 

  7. Jones JP: Diophantine representation of the Fibonacci numbers. Fibonacci Q. 1975, 13: 84–88.

    Google Scholar 

  8. Jones JP: Diophantine representation of the Lucas numbers. Fibonacci Q. 1976, 14: 134.

    Google Scholar 

  9. Jones JP, Kiss P: On points whose coordinates are terms of a linear recurrence. Fibonacci Q. 1993, 31: 239–245.

    MathSciNet  Google Scholar 

  10. Jones JP: Representation of solutions of Pell equations using Lucas sequences. EKTF Tud. Közl., Tanulm. Mat. Tud. Köréből 2003, 30: 75–86.

    Google Scholar 

  11. Demirtürk B, Keskin R: Integer solutions of some Diophantine equations via Fibonacci and Lucas numbers. J. Integer Seq. 2009, 12: 1–14.

    Google Scholar 

  12. Hilton P, Pedersen J, Somer L: On Lucasian numbers. Fibonacci Q. 1997, 35: 43–47.

    MathSciNet  Google Scholar 

  13. Hilton P, Pedersen J: On generalized Fibonaccian and Lucasian numbers. Math. Gaz. 2006, 90(518):215–222.

    Google Scholar 

  14. Hinkel, DE: An investigation of Lucas Sequences, pp. 1–35. Master Thesis, Arizona University (2007)

    Google Scholar 

  15. Ribenboim P: An algorithm to determine the points with integral coordinates in certain elliptic curves. J. Number Theory 1999, 74: 19–38. 10.1006/jnth.1998.2290

    MathSciNet  Article  Google Scholar 

  16. Ribenboim P: My Numbers, My Friends. Springer, New York; 2000.

    Google Scholar 

  17. Horadam AF: Basic properties of certain generalized sequences of numbers. Fibonacci Q. 1965, 3(3):161–176.

    MathSciNet  Google Scholar 

  18. Ribenboim P: Square classes of Fibonacci and Lucas numbers. Port. Math. 1989, 46(2):159–175.

    MathSciNet  Google Scholar 

  19. Ribenboim P: The Little Book of Big Primes. Springer, New York; 1991.

    Book  Google Scholar 

  20. Kimberling C: Fibonacci hyperbolas. Fibonacci Q. 1990, 28: 22–27.

    MathSciNet  Google Scholar 

  21. Keskin R: Solutions of some quadratic Diophantine equations. Comput. Math. Appl. 2010, 60: 2225–2230. 10.1016/j.camwa.2010.08.012

    MathSciNet  Article  Google Scholar 

Download references

Acknowledgements

Dedicated to Professor Hari M Srivastava.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bahar Demirtürk Bitim.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors contributed equally in the preparation of this article. Both the authors read and approved the final manuscript.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Demirtürk Bitim, B., Keskin, R. On some Diophantine equations. J Inequal Appl 2013, 162 (2013). https://doi.org/10.1186/1029-242X-2013-162

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1029-242X-2013-162

Keywords

  • generalized Fibonacci and Lucas sequences
  • Diophantine equations