Beruflich Dokumente
Kultur Dokumente
Woden Kusner
University of Pittsburgh
Introduction
Division Algorithm:
Given integers a, d
with d 6= 0, there
exist unique integers
q,r such that
a = qd + r
and
0 r < |d|
A Theorem of Lam
e
Fibonacci Numbers:
F1 := 1
F2 := 1
Fn := Fn1 + Fn2
for n 2
an Fn+1
Proof. Now we may construct a lower bound for an .
an+1 = qn an + an1
a
=
q
a
+
a
0
< an2 < an1
n
n1
n1
n2
a
=
q
a
+
a
0
<
an3 < an2
n2 n2
n3
n1.
..
..
.
n steps
..
..
.
.
a
=
q
a
+
a
0
<
a
3
2 2
1
1 < a2
a2 = q1 a1 + 0
q1 > 1
Notice q1 6= 1. Otherwise a2 = a1 , a contradiction to the Euclidean
algorithm. Therefore q1 2, also, a1 1. For all other q, qi 1, n i > 1.
We have inequalities ak ak1 + ak2 , with a1 1 = F2 and a2 2 = F3 .
Therefore ak Fk + 1 for all k, in particular, an Fn + 1
We will now establish a relationship between and the Fibonacci Numbers.
Lemma 2.
n = Fn + Fn1
Proof. We proceed by induction.
The base case is follows trivially from definitions
a+b
a
= :=
a
b
a = b
b + b
=
b
+ 1 = 2
2 = F2 + F1
We may assume
n1 = Fn1 + Fn2
2
n1 = (Fn1 + Fn2 )
n = Fn1 2 + Fn2
n = Fn1 ( + 1) + Fn2
n = (Fn1 + Fn2 ) + Fn1
n = Fn + Fn1
Fn1
Fn + Fn1 = Fn+1
ln an
+1
ln
References
[1] David S. Dummit and Richard M. Foote. Abstract Algebra. John Wiley
and Sons, Inc, 2004.
[2] Ross Honsberger. Mathematical Gems II: Dolciani Mathematical Expositions 2. MAA, 1976.
[3] Melvyn B. Nathanson. Elementary Methods in Number Theory. Springer,
1999.
[4] Ivan Niven, Herbert S. Zuckerman, and Hugh L. Montgomery. An Introduction to the Theory of Numbers. John Wiley and Sons, Inc, 1991.