On squares in Lucas sequences

Details On squares in Lucas sequences On squares in Lucas sequences

2006-10-24

arxiv.org/abs/math/0610732v1

Mathematics

Number Theory

11 pages. To appear in Journal of Number Theory

Scientific paper

Let P and Q be non-zero integers. The Lucas sequence U_n(P,Q) is defined by U_0=0, U_1=1, U_n= P*U_{n-1}-Q*U_{n-2} for n >1. The question of when U_n(P,Q) can be a perfect square has generated interest in the literature. We show that for n=2,...,7, U_n is a square for infinitely many pairs (P,Q) with gcd(P,Q)=1; further, for n=8,...,12, the only non-degenerate sequences where gcd(P,Q)=1 and U_n(P,Q)=square, are given by U_8(1,-4)=21^2, U_8(4,-17)=620^2, and U_12(1,-1)=12^2.

Affiliated with

Also associated with

No associations

Rating

On squares in Lucas sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On squares in Lucas sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On squares in Lucas sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-344045