Scribd
Upload
30 views3 pages

Lucas Numbers

Lucas Numbers

Uploaded by

Daniel Solomon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
30 views3 pages

Lucas Numbers

Lucas Numbers

Uploaded by

Daniel Solomon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Lucas Numbers

Prove: Ln=round ( Φ n )
Step 1: Explicit Formula for Lucas Numbers
The Lucas sequence {Ln } satisfies the recurrence relation:

Ln=Ln−1 + Ln−2 ,

with initial conditions L0=2 and L1=1.

The explicit formula for Ln is:

n n
Ln=Φ +ψ ,

1+ √ 5 1− √ 5
where Φ is the Golden Ratio Φ= , and ψ is its conjugate ψ= .
2 2
Step 2: Key Properties of Φ and ψ
1. Roots of the Quadratic Equation:
Both Φ and ψ satisfy the quadratic equation:
2
x =x +1 .
Therefore:
2 2
Φ =Φ+1 and ψ =ψ+ 1.
2. Magnitude of ψ :
The absolute value of ψ is:
1
x|ψ|= ≈ 0.618 .
Φ

|ψ n|→ 0 exponentially fast. This means ψ n becomes negligible for large n.


Step 3: Approximation of Ln by Φ n
Using the explicit formula:
n n
Ln=Φ +ψ ,

and noting that ψ n is very small for large n , we approximate:


n
Ln ≈Φ .

However, ψ n introduces a small corrective term. To rigorously show that


Ln=round ( Φ n ), we analyze the impact of ψ n on Φ n.

Step 4: Rounding Φ n

Write Φ n as:
n n
Φ =Ln−ψ .
n
¿ ψ ∨¿ 0.5 for all n ≥ 0. Therefore:
 If ψ n >0 , it slightly decreases Φ n below Ln.

 If ψ n <0 , it slightly increases Φ n above Ln.

In both cases, rounding Φ n to the nearest integer eliminates the effect of ψ n,


yielding:

round ( Φ n )=Ln .

Step 5: Verification for Initial Values


Check the relationship for small n: 1. For n=0:
0
Φ =1 , L0 =2 , round ( 1 ) =2.

2. For n=1:
1
Φ =Φ , L1=1 , round ( Φ )=1 .

3. For n=2:
2
Φ =Φ+1 ≈ 2.618 , L2=3 , round ( 2.618 )=3 .

Step 6: Inductive Proof

Assume the relationship holds for n=k , i.e., Lk =round ( Φk ). We prove it for
n=k +1:
From the recurrence relation:
Lk+ 1=Lk + Lk−1 .

Using the explicit formula:

Lk+ 1=( Φ k +ψ k ) + ( Φ k−1 +ψ k −1 ) =Φk +1+ ψ k+1 .

By the inductive hypothesis, round ( Φ k )=Lk and round ( Φ k−1 )=Lk−1. Therefore:
round ( Φ k+1 ) =round ( Φ k + Φk−1 )=L k + L k−1 =Lk+1 .

Conclusion
By induction and analysis of ψ n, we conclude:

Ln=round ( Φ n ) .

You might also like