Download Fibonacci Rectangles - Oldham Sixth Form College

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project

Document related concepts

Mathematics of radio engineering wikipedia, lookup

Philosophy of mathematics wikipedia, lookup

Law of large numbers wikipedia, lookup

Numbers (TV series) wikipedia, lookup

List of important publications in mathematics wikipedia, lookup

Infinity wikipedia, lookup

Infinitesimal wikipedia, lookup

Mathematics wikipedia, lookup

Recurrence relation wikipedia, lookup

Bernoulli number wikipedia, lookup

Hyperreal number wikipedia, lookup

History of mathematics wikipedia, lookup

Series (mathematics) wikipedia, lookup

Georg Cantor's first set theory article wikipedia, lookup

Foundations of mathematics wikipedia, lookup

Large numbers wikipedia, lookup

Real number wikipedia, lookup

Proofs of Fermat's little theorem wikipedia, lookup

Sequence wikipedia, lookup

Ethnomathematics wikipedia, lookup

Arithmetic wikipedia, lookup

Collatz conjecture wikipedia, lookup

Addition wikipedia, lookup

Elementary mathematics wikipedia, lookup

Transcript
Fibonacci Numbers
Fibonacci Numbers
•
•
•
•
•
•
•
In mathematics, the Fibonacci numbers are a sequence of numbers
named after Leonardo of Pisa, known as Fibonacci, whose Liber Abaci
published in 1202 introduced the sequence to Western European
mathematics.
The sequence is defined by the following recurrence relation:
That is, after two starting values, each number is the sum of the two
preceding numbers. The first Fibonacci numbers also denoted as Fn, for
n = 0, 1, … , are: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610,
987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393,
…
Each third number of the series is an even number.
The sequence named after Fibonacci was first described in Indian
mathematics.
The sequence extended to negative index n satisfies Fn = Fn−1 + Fn−2 for
all integers n, and F-n = (−1)n+1Fn:
.., -8, 5, -3, 2, -1, 1, followed by the sequence above.
Fibonacci Rectangles
1
1 1
1 1
2
1 1
2
3
1 1
2
3
5
1 1
8
2
3
5
13
1 1
8
2
3
5
13
1 1
8
2
3
5