History and introduction to Fibonacci numbers

Fibonacci numbers in nature

Fibonacci numbers and the Pascal triangle
Fibonacci numbers and the Golden ratio
Fibonacci number applications (phyllotaxis)
Fibonacci numbers in art and architecture
Binet formula for finding a particular Fibonacci number

Month

No

Jan 1

An

Feb 1

An
An

Mar 1
Apr 1
May 1

June 1
July 1
Aug 1
Sep 1
Oct 1
Nov 1
Dec 1

bn

An
An

bn
bn

bn

An

An

An
An

An
bn

An

bn
bn

An

F1 = 1

F16 = 987

F2 = 1

F17 = 1,597

F3 = 2

F18 = 2,584

F4 = 3

F19 = 4,181

F5 = 5

F20 = 6,765

F6 = 8

F21 = 10,946

F7 = 13

F22 = 17,711

F8 = 21

F23 = 28,657

F9 = 34

F24 = 46,368

F10 = 55

F25 = 75,025

F11 = 89

F26 = 121,393

F12 = 144

F27 = 196,418

F13 = 233

F28 = 317,811

F14 = 377

F29 = 514,229

F15 = 610

F30 = 832,040

the sum of the number of pairs in the previous month and the number of pairs of newborn rabbits
i.e. the sum of the first n Fibonacci numbers is equal to the Fibonacci number two further along the
sequence minus 1.

To be able to predict which Fibonacci number will result from the sum of the squares of a consecutive
pair of Fibonacci numbers, we will want to inspect their position in the sequence.
try another consecutive pair of Fibonacci numbers and see what the sum of the squares of these
numbers is

Lemma

Fm+n = Fm-1 Fn + Fm Fn+1

Proof of lemma

by induction on n.

For n = 1, we have to check that Fm+1 = Fm-1 F1 + FmF2, or, since F2 = 1 and F2 = 1, we have to check that
Fm+1 = Fm-1 + Fm ; this is true because it is the very relation by which we define the Fibonacci numbers.
For n = 2, we have to check that Fm+2 = Fm-1 F2 + Fm F3 , or, since F2 = 1 and F3 = 2, we have to check that
Fm+2 = Fm-1 + 2Fm ; and this is true by the following sequence of equalities:

Fm-1 + 2Fm = (Fm-1 + Fm) + Fm = Fm+1 + Fm = Fm+2

Now assume the statement is true for n = k - 1 and n = k, that is, assume
Fm+k-1 = Fm-1 Fk-1 + Fm Fk
and
Fm+k = Fm-1 Fk + Fm Fk+1
(induction hypothesis)
Then, Fm-1 Fk+1 + Fm Fk+2
= Fm-1 (Fk-1 + Fk) + Fm (Fk + Fk+1)
= Fm-1 Fk-1 + Fm-1 Fk + Fm Fk + Fm Fk+1
= Fm-1 Fk + Fm Fk+1 + Fm-1 Fk-1 + Fm Fk
= Fm+k + Fm+k-1
= Fm+k+1
i.e. Fm-1 Fk+1 + Fm Fk+2 = Fm+k+1 , which is exactly the statement for n = k + 1.

Using this lemma, by substituting m = k and n = k 2, we see

Fk-1 Fk-2 + Fk Fk-1 = Fk+k-2 = F2k-2
Hence Fk2 Fk-22 = F2k-2

CONTENTS INDEX
Page No:
SUMMARY

vi

1. GIRI

2. FIBONACCI DIZISININ MATEMATIKSEL

ZELLIKLERI VE ALTIN ORAN

2.1 FIBONACCI SAYILARIYLA ELDE EDILEN ZDELIKLER

14

3. GEOMETRIDEKI VE DOADAKI UYGULAMALARI

24

3.1 BYK PIRAMIT VE ALTIN ORAN

36

4. EKONOMIDEKI UYGULAMALARI

41

4.1 FIBONACCI ORANLARI

41

4.2 FIBONACCI YZDE GERI EKILMELERI

42

4.3 FIBONACCI ZAMAN EVRIMLERI

44

4.4 ALMAIKLIK KURALI-RULE OF ALTERNATION

45

4.5 FIBONACCI BOX

49

4.6 ZAMAN VE FIYAT HEDEFLERI 52

EKLER
EK-1: ILK 50 FIBONACCI SAYISI VE ARPANLARINA AYRILMI HALI 56
EK-2: FIBONACCI SAYILARINI VEREN ALGORITMA VE PROGRAM 58
KAYNAKLAR 60
ZGEMI 61

Fibonacci numbers, GOLDEN RATIO AND

APPLICATIONS

SUMMARY
In this thesis, we examine the mathematical properties of Fibonacci numbers and its
application in nature, economics/finance and geometry.

By getting the Golden Ratio, we used to prove some mathematical identities. The
infinity of prime numbers has also been demonstrated using Fibonacci numbers. which
encounters with Fibonacci numbers in nature, it was examined in detail with examples. We
also give examples of the relationship between Fibonacci numbers and the market
movements were investigated.

SUMMARY
In this thesis we examined mathematical properties of Fibonacci numbers and
applications of this numbers in the nature,geometry and economy.
We obtained Golden section and proved some mathematical identities using Golden
section. Infinity of the prime numbers proved by using properties of Fibonacci numbers.
Encounterings with Fibonacci numbers in the nature are examined with details. Also examples
are given for relation about Fibonacci numbers and stock exchange and these are examined.

Table of Contents
Page No:
Summary

vi

Table of Contents

viii

1.

GR

2.

Mathematical features of the Fibonacci sequence and the golden ratio

2.1

Obtained identities on the fibonacci numbers

14

3.

Applications in nature and geometry

24

3.1

Great pyramid and the golden ratio

36

4.

Applications in economics and finance

41

4.1

Fibonacci ratios

41

4.2

FBONACC YZDE GER EKLMELER (WITHDRAWAL of Fibonacci PERCENT) 42

4.3

Fibonacci time cycles (periodicity)

44

4.4

ALMAIKLIK KURALI-RULE OF ALTERNATON

45

4.5

FBONACC BOX

49

4.6

Time and price targets

52

Attachments
EK-1: LK 50 FBONACC SAYISI VE ARPANLARINA AYRILMI HAL

56

EK-2: FBONACC SAYILARINI VEREN ALGORTMA VE PROGRAM

58

Resources

60

Resume

61

GR
Fibonacci saylar gnmzde matematik alannda en ok ilgi eken konularn basnda gelir.
Bunun nedeni Fibonacci saylarnn kefedilmeye uygun yapsdr. Geometride, doada,
ekonomide ve sanatta bir ok uygulamalar bulunmaktadr. Fibonacci saylarna zellikle
doada ok sk rastlamaktayz. Kefedilmeyi bekleyen bir ok zellii bulunan, kesfedilen
fakat ispatlanamayan da birok zellii bulunan Fibonacci dizisi ayrca daha nce ispatlanan
baz matematiksel zelliklere yeni ispat yollar vermektedir(asal saylarn sonsuz olduunu
gsterirken olduu gibi).
Fibonacci numbers in mathematics today comes the most interesting issues in the press. This
is due to the structure suitable for the discovery of the Fibonacci numbers. Geometry in
nature, there are many applications in the economy and the arts. We find very often in nature,
particularly the Fibonacci numbers. It has a lot of features waiting to be discovered, the
Fibonacci sequence with the many features that can not be discovered while but proved also
provides new proof way to some mathematical properties demonstrated previously (as
shows that it is infinite prime numbers).

SERIES FEATURES AND MATHEMATICAL the

Fibonacci golden ratio
u1 = 1 , u2 = 1 baseline values and un = un-1 + un-2 a defined sequence called the Fibonacci
sequence correlation with reduction. Reduction equation, un un-1 un-2 = 0 and the
characteristic equation 2 1 = 0 including the roots of the characteristic equation,
1 =

1+5
2

un = A1[

and 2 =

1+5
2

15
2

] + A2 [

15
2

the general terms of the directory including,

It is inside. The initial value of the

1+5

A1[

15

] + A2 [

] =1