Professional Documents
Culture Documents
Abstract
Let P and Q be non-zero relatively prime integers. The Lucas sequence fUn ðP; QÞg is
defined by
We show that the only sequence with U12 ðP; QÞ a perfect square is the Fibonacci sequence
fUn ð1; 1Þg; and we show that there are no non-degenerate sequences fUn ðP; QÞg with
U9 ðP; QÞ a perfect square. The argument involves finding all rational points on several curves
of genus 2.
r 2004 Elsevier Inc. All rights reserved.
1. Introduction
Let P and Q be non-zero relatively prime integers. The Lucas sequence fUn ðP; QÞg
is defined by
Corresponding author. Fax: +480-965-8119.
E-mail addresses: bremner@asu.edu (A. Bremner), tzanakis@math.uoc.gr (N. Tzanakis).
URLs: http://math.la.asu.edu/~andrew/bremner.html, http://www.math.uoc.gr/~tzanakis.
0022-314X/$ - see front matter r 2004 Elsevier Inc. All rights reserved.
doi:10.1016/j.jnt.2004.04.002
ARTICLE IN PRESS
216 A. Bremner, N. Tzanakis / Journal of Number Theory 107 (2004) 215–227
The sequence fUn ð1; 1Þg is the familiar Fibonacci sequence, and it was proved by
Cohn [12] in 1964 that the only perfect square greater than 1 in this sequence is
U12 ¼ 144: The question arises, for which parameters P; Q; can Un ðP; QÞ be a perfect
square? This has been studied by several authors: see for example [13–15,22,25].
Using Baker’s method on linear forms in logarithms, work of Shorey and Tijdeman
[26] implies that there can only be finitely many squares in the sequence fUn ðP; QÞg:
Ribenboim and McDaniel [23] with only elementary methods show that when P and
Q are odd, and P2 4Q40; then Un can be square only for n ¼ 0; 1; 2; 3; 6 or 12;
and that there are at most two indices greater than 1 for which Un can be square.
They characterize fully the instances when Un ¼ &; for n ¼ 2; 3; 6; and observe that
U12 ¼ & if and only if there is a solution to the Diophantine system
When P is even, a later paper of Ribenboim and McDaniel [24] proves that if
Q 1 ðmod 4Þ; then Un ðP; QÞ ¼ & for n40 only if n is a square or twice a square,
and all prime factors of n divide P2 4Q: Further, if p2t jn for a prime p; then Up2u is
square for u ¼ 1; y; t: In addition, if n is even, then Un ¼ & only if P is a square or
twice a square. A remark is made that no example is known of an integer pair P; Q;
and an odd prime p; such that Up2 ¼ & (note none can exist for P; Q odd,
P2 4Q40).
In this paper, we complete the results of Ribenboim and MacDaniel [23] by
determining all Lucas sequences fUn ðP; QÞg with U12 ¼ & (in fact, the result is
extended, because we do not need the restrictions that P; Q be odd, and
P2 4Q40): it turns out that the Fibonacci sequence provides the only example.
Moreover, we also determine all Lucas sequences fUn ðP; QÞg with U9 ¼ &; subject
only to the restriction that ðP; QÞ ¼ 1: Throughout this paper the symbol & means
square of a non-zero rational number.
Theorem 1. Let ðP; QÞ be any pair of relatively prime non-zero integers. Then,
* U12 ðP; QÞ ¼ & iff ðP; QÞ ¼ ð1; 1Þ (corresponding to the Fibonacci sequence).
* U9 ðP; QÞ ¼ & iff ðP; QÞ ¼ ð72; 1Þ (corresponding to the sequences Un ¼ n and
Un ¼ ð1Þnþ1 n).
The remainder of the paper is devoted mainly to the proof of this theorem.
Theorems 3 and 6 of [23] combined with the first statement of Theorem 1 imply the
following.
Theorem 2. Let P; Q be relatively prime odd integers, such that P2 4Q40: Then the
nth term, n41; of the Lucas sequence Un ¼ Un ðP; QÞ can be a square only if n ¼ 2; 3; 6
or 12. More precisely:1
1
Below it is understood that parameters a; b are in every case chosen so that P; Q are odd, relatively
prime and P2 4Q40:
ARTICLE IN PRESS
A. Bremner, N. Tzanakis / Journal of Number Theory 107 (2004) 215–227 217
* U2 ¼ & iff P ¼ a2 :
* U3 ¼ & iff P ¼ a; Q ¼ a2 b2 :
8 4 4 8
* U6 ¼ & iff P ¼ 3a2 b2 ; Q ¼ a þ12a2 b 9b :
* U12 ¼ & iff ðP; QÞ ¼ ð1; 1Þ: Moreover, this result is also valid even if we remove
all restrictions on P; Q except for gcdðP; QÞ ¼ 1:
The proof of Theorem 1 hinges, in both cases, upon finding all rational points on a
curve of genus 2. When the rank of the Jacobian of such a curve is less than 2, then
methods of Chabauty [11], as expounded subsequently by Coleman [16], Cassels and
Flynn [10] and Flynn [17] may be used to determine the (finitely many) rational
points on the curve. When the rank of the Jacobian is at least 2, as is the case here, a
direct application of these methods fails. In order to deal with such situations, very
interesting methods have been developed recently by a number of authors; see
Chapter 1 of Wetherell’s Ph.D. thesis [31], Bruin [2–4], Bruin and Flynn [7,8], Flynn
[18], and Flynn and Wetherell [19,20]. For the purpose of this paper, the method of
[18,19] is sufficient.
Now ðPðP2 3QÞðP2 QÞ; ðP2 QÞðP 4 4P2 Q þ Q2 ÞÞ divides 2, so that U12 ¼ &
implies
ð1 2xÞð1 4x þ x2 Þ ¼ d&
and of these four elliptic curves, only the curve with d ¼ 2 has positive rational rank.
Torsion points on the three other curves do not provide any solutions for P; Q: We
are thus reduced to considering the equations
from which
P2 2Q ¼ Z&; P 4 4P2 Q þ Q2 ¼ 2Z& or
P P2 3Q P2 Q P2 2Q P 4 4P2 Q þ Q2
& 2& & & 2&
6& 3& & 2& &
& 2& & & 2&
& & 2& 3& 6&
and consequently the rational points on the curves corresponding to the first three rows
of the above table are straightforward to determine: they are ðP; QÞ ¼ ð1; 1Þ; ð0; 1Þ;
and ð1; 1Þ; respectively. These lead to degenerate Lucas sequences with U12 ¼ 0:
It remains only to find all rational points on the following curve:
satisfying ðP; QÞ ¼ 1: Note that this is the curve (2), though we have removed the
restriction that P and Q be odd, and P2 4Q40:
Put Q=P2 ¼ 1 2u2 ; so that
Eq. (8) defines a curve of genus 9, with certainly only finitely many points. We
restrict attention to the curve of genus 2 defined by
So
3 6
P 9P 4 R2 þ 6dP2 R4 þ d2 R6 ¼ &; ð11Þ
d
3 3 3
9x þ 6dx2 þ d2 x3 ¼ &; x 9x2 þ 6dx þ d2 ¼ &: ð12Þ
d d
For d ¼ 71; the first curve has rational rank 0, and torsion points do not lead to
non-zero solutions for P; Q: For d ¼ 73; both curves at (12) have rational rank 1, so
that the rank of the Jacobian of (11) equals 2. To solve the equation U9 ðP; QÞ ¼ &;
it is necessary to determine all integer points on the two curves
and
2.2.1
Eq. (13) may be written in the form
Suppose P is a first degree prime ideal of OL dividing ðlÞ: Then for the norm of l to
be a square, l must also be divisible by one of the conjugate prime ideals of P: It
follows that P; or one of its conjugates, divides both l and ls : Then this prime will
divide ðð5 þ a þ a2 Þ ð5 2a þ a2 ÞÞ ¼ ð3aÞ ¼ ð1 aÞ3 : So P has to be ð1 aÞ;
with ð1 aÞ2 dividing l; contradicting l squarefree. If the residual degree of P is 3,
then the norm of l cannot be square. Finally, the residual degree of P cannot be 2,
otherwise y ¼ 5 a a2 m ðmod PÞ; for some rational integer m; so that a ¼
1 2y þ 13 y2 is congruent to a rational integer modulo P; impossible. In
consequence, l is forced to be a unit, of norm þ1: Without loss of generality, the
only possibilities are l ¼ 1; e1 ; e2 ; e1 e2 : However, specializing the left-hand side of
(15) at the root a0 ¼ 1:8793852415::: of x3 3x 1 ¼ 0 shows that P2 þ
0:4114::R2 ¼ lða0 ÞUða0 Þ2 ; so that lða0 Þ40; giving unsolvability of (15) for l ¼
e2 ; e1 e2 : There remain the two cases l ¼ 1; with solution ðP; R; UÞ ¼ ð1; 0; 1Þ; and
l ¼ e1 ; with solution ðP; R; UÞ ¼ ð0; 1; 4 a2 Þ: From (15) and (16) we now have
We shall see that the QðaÞ-rank of E2 is 1, with generator of infinite order equal to
ð1; aÞ:
2.2.2
Eq. (14) may be written in the form
so that
ð1aÞ2 R2
is the x-coordinate of a point on the elliptic curve
shows that the QðaÞ-rank of (20) is equal to 0; with torsion group the obvious group
of order 4. There are no corresponding solutions for P; Q:
Here we justify our assertions about the elliptic curves E1 at (9) and E2 at (18).
These curves are defined over fields F (where F =K or L; respectively) with unique
factorization, and have F -rational two-torsion. So standard two-descents over F
work analogously to the standard two-descent over Q for an elliptic curve with
rational two-torsion; see for example Silverman [28, Chapter 10.4]. It is thus
ARTICLE IN PRESS
A. Bremner, N. Tzanakis / Journal of Number Theory 107 (2004) 215–227 223
4. Finding all points on (9) and (18) under the rationality conditions
The problems to which we were led in Section 2 are of the following shape.
Problem. Let
E : y2 þ a1 xy þ a3 y ¼ x3 þ a2 x2 þ a4 x þ a6 ; ð21Þ
For the solution of this type of problem we adopt the technique described and
applied in [19].2 Several problems of this type have already been solved with a similar
technique (besides [19], see also [4,8,18,20]); therefore we content ourselves with a
rather rough description of the employed method and refer the interested reader to
Section 4 of [1] for a detailed exposition.
We assume the existence of a rational prime p with the following properties:
(i) f ðX Þ is irreducible in Qp ½X
:
(ii) The coefficients of (21) are in Zp ½a
:
2
But see also the references at the end of Section 1.
ARTICLE IN PRESS
224 A. Bremner, N. Tzanakis / Journal of Number Theory 107 (2004) 215–227
(iii) Eq. (21) is a minimal Weierstrass equation for E=Qp ðaÞ at the unique discrete
valuation v defined on QðaÞ with vðpÞ ¼ 1:
(iv) bAQp ðaÞ is a p-adic unit.
Suppose now we know a point such that zðQÞApr Zp ½a
and assume further that, for a
certain specifically known point PAQðaÞ-EðZp ½a
Þ; or for P ¼ O; we want to find all
nAZ for which bxðP þ nQÞ is a rational number (or, more particularly, a square of a
rational). According to whether P is a finite point or P ¼ O; we express bxðP þ nQÞ
or 1=bxðnQÞ first as an element of Zp ½a
½½zðnQÞ
and then, using properties (22) and
(23), as a sum y0 ðnÞ þ y1 ðnÞa þ ? þ yd1 ðnÞad1 ; where each series yi ðnÞ is a p-
adically convergent power series in n with coefficients in Zp ; which can be explicitly
calculated up to any desired p-adic precision. In order that this sum be a rational
number we must have yi ðnÞ ¼ 0 for i ¼ 1; y; d 1: At this point we use Strassman’s
Theorem,3 which restricts the number of p-adic integer solutions n: If the maximum
number of solutions implied by this theorem is equal to the number of solutions that
3
Theorem 4.1, in [9].
ARTICLE IN PRESS
A. Bremner, N. Tzanakis / Journal of Number Theory 107 (2004) 215–227 225
Acknowledgments
We are grateful to the referee for suggestions which have greatly improved the
presentation of this paper.
References
[1] A. Bremner, N. Tzanakis, Lucas sequences whose 12th or 9th term is a square, Extended version,
http://www.math.uoc.gr/~tzanakis/Papers/Fibonacci 9 12.pdf.
[2] N. Bruin, Chabauty methods and covering techniques applied to generalized Fermat equations, CWI
Tract, Vol. 133, Stichting Mathematisch Centrum voor Wiskunde en Informatica, Amsterdam, 2002;
Dissertation, University of Leiden, Leiden, 1999.
[3] N. Bruin, The diophantine equations x2 7y4 ¼ 7z6 and x2 þ y8 ¼ z3 ; Compositio Math. 118 (1999)
305–321.
[4] N. Bruin, Chabauty methods using elliptic curves, J. Reine Angew. Math. 562 (2003) 27–49.
[5] N. Bruin, http://www.cecm.sfu.ca/~bruin/ell.shar
[6] N. Bruin, http://www.cecm.sfu.ca/~bruin/malgae.tgz
[7] N. Bruin, E.V. Flynn, Towers of 2-covers of hyperelliptic curves, PIMS-01-12, Pacific Institute Math.
Sci., 2001, preprint.
ARTICLE IN PRESS
A. Bremner, N. Tzanakis / Journal of Number Theory 107 (2004) 215–227 227
[8] N. Bruin, E.V. Flynn, N-covers of hyperelliptic curves, Math. Proc. Cambridge Philos. Soc. 134
(2003) 397–405.
[9] J.W.S. Cassels, Local Fields, in: London Mathematical Society Student Texts, Vol. 3, Cambridge
University Press, Cambridge and London, 1986.
[10] J.W.S. Cassels, E.V. Flynn, Prolegomena to a Middlebrow Arithmetic of Curves of Genus 2, in:
London Mathematical Society Lecture Note Series, Vol. 230, Cambridge University Press,
Cambridge, 1996.
[11] C. Chabauty, Sur les points rationnels des courbes algébriques de genre supérieur à l’unité, C. R.
Acad. Sci. Paris 212 (1941) 882–885.
[12] J.H.E. Cohn, On square Fibonacci numbers, J. London Math. Soc. 39 (1964) 537–541.
[13] J.H.E. Cohn, Eight Diophantine equations, Proc. London Math. Soc. 16 (1966) 153–166.
[14] J.H.E. Cohn, Five Diophantine equations, Math. Scand. 21 (1967) 61–70.
[15] J.H.E. Cohn, Squares in some recurrent sequences, Pacific J. Math. 41 (1972) 631–646.
[16] R.F. Coleman, Effective Chabauty, Duke Math. J. 52 (1985) 765–770.
[17] E.V. Flynn, A flexible method for applying Chabauty’s Theorem, Compositio Math. 105 (1997)
79–94.
[18] E.V. Flynn, On Q-derived polynomials, Proc. Edinburgh Math. Soc. 44 (2001) 103–110.
[19] E.V. Flynn, J.L. Wetherell, Finding rational points on bielliptic genus 2 curves, Manuscripta Math.
100 (1999) 519–533.
[20] E.V. Flynn, J.L. Wetherell, Covering collections and a challenge problem of Serre, Acta Arithm. 98
(2001) 197–205.
[21] M. Kida, TECC Manual Version 2.4, The University of Electro-Communications, September 2000.
[22] W. Ljunggren, New propositions about the indeterminate equation ðxn 1Þ=ðx 1Þ ¼ yq ; Norske
Mat. Tidsskr. 25 (1943) 17–20.
[23] P. Ribenboim, W.L. McDaniel, The square terms in Lucas sequences, J. Number Theory 58 (1996)
104–123.
[24] P. Ribenboim, W.L. McDaniel, Squares in Lucas sequences having an even first parameter, Colloq.
Math. 78 (1998) 29–34.
[25] N. Robbins, On Pell numbers of the form PX 2 ; where P is prime, Fibonacci Quart. (4) (1984)
340–348.
[26] T.N. Shorey, R. Tijdeman, Exponential Diophantine Equations, Cambridge University Press,
Cambridge, 1986.
[27] S. Siksek, Infinite descent on elliptic curves, Rocky Mountain J. Math. 25 (4) (1995) 1501–1538.
[28] J.H. Silverman, The Arithmetic of Elliptic Curves, in: Graduate Texts in Mathematics, Vol. 106,
Springer, Berlin and New York, 1986.
[29] J.H. Silverman, The difference between the Weil height and the canonical height on elliptic curves,
Math. Comp. 55 (192) (1990) 723–743.
[30] D. Simon, http://www.math.unicaen.fr/~simon/ell.gp
[31] J.L. Wetherell, Bounding the number of rational points on certain curves of high rank, Ph.D.
Dissertation, University of California at Berkeley, 1997.