Lehmer sequence

From testwiki
Jump to navigation Jump to search

Template:Hatnote In mathematics, a Lehmer sequence Un(R,Q) or Vn(R,Q) is a generalization of a Lucas sequence Un(P,Q) or Vn(P,Q), allowing the square root of an integer R in place of the integer P.[1]

To ensure that the value is always an integer, every other term of a Lehmer sequence is divided by Template:Radic compared to the corresponding Lucas sequence. That is, when R = P2 the Lehmer and Lucas sequences are related as:

PU2n(P2,Q)=U2n(P,Q)U2n+1(P2,Q)=U2n+1(P,Q)V2n(P2,Q)=V2n(P,Q)PV2n+1(P2,Q)=V2n+1(P,Q)

Algebraic relations

If a and b are complex numbers with

a+b=R
ab=Q

under the following conditions:

Then, the corresponding Lehmer numbers are:

Un(R,Q)=anbnab

for n odd, and

Un(R,Q)=anbna2b2

for n even.

Their companion numbers are:

Vn(R,Q)=an+bna+b

for n odd and

Vn(R,Q)=an+bn

for n even.

Recurrence

Lehmer numbers form a linear recurrence relation with

Un=(R2Q)Un2Q2Un4=(a2+b2)Un2a2b2Un4

with initial values U0=0,U1=1,U2=1,U3=RQ=a2+ab+b2. Similarly the companion sequence satisfies

Vn=(R2Q)Vn2Q2Vn4=(a2+b2)Vn2a2b2Vn4

with initial values V0=2,V1=1,V2=R2Q=a2+b2,V3=R3Q=a2ab+b2.

All Lucas sequence recurrences apply to Lehmer sequences if they are divided into cases for even and odd n and appropriate factors of Template:Radic are incorporated. For example,

U2n(R,Q)=RU2n1(R,Q)QU2n2(R,Q)U2n+1(R,Q)=RU2n(R,Q)QU2n1(R,Q)V2n(R,Q)=RV2n1(R,Q)QV2n2(R,Q)V2n+1(R,Q)=RV2n(R,Q)QV2n1(R,Q)

References

Template:Reflist


Template:Numtheory-stub