Fibonacci number From Wikipedia, the free encyclopedia Jump to: navigation, search

A tiling with squares whose sides are successive Fibonacci numbers in length

A Fibonacci spiral created by drawing circular arcs connecting the opposite corners of squares in the Fibonacci tiling; this one uses squares of sizes 1, 1, 2, 3, 5, 8, 13, 21, and 34. See golden spiral. In mathematics, the Fibonacci numbers or Fibonacci series or Fibonacci sequence are the numbers in the following integer sequence: (sequence A000045 in OEIS). By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation

with seed values[1]

The Fibonacci sequence is named after Leonardo of Pisa, who was known as Fibonacci. Fibonacci's 1202 book Liber Abaci introduced the sequence to Western European mathematics,[2] although the sequence had been described earlier in Indian mathematics.[3][4][5] (By modern convention, the sequence begins with F0 = 0. The Liber Abaci began the sequence with F1 = 1, omitting the initial 0, and the sequence is still written this way by some.) Fibonacci numbers are closely related to Lucas numbers in that they are a complementary pair of Lucas sequences. They are intimately connected with the golden ratio, for example the closest rational approximations to the ratio are 2/1, 3/2, 5/3, 8/5, ... . Applications include computer algorithms such as the Fibonacci search technique and the Fibonacci heap data structure, and graphs called Fibonacci cubes used for interconnecting parallel and distributed systems. They also appear in biological settings,[6] such as branching in trees, Phyllotaxis (the arrangement of leaves on a stem), the fruit

spouts of a pineapple,[7] the flowering of artichoke, an uncurling fern and the arrangement of a pine cone.[8] Origins The Fibonacci sequence appears in Indian mathematics, in connection with Sanskrit prosody.[4][9] In the Sanskrit oral tradition, there was much emphasis on how long (L) syllables mix with the short (S), and counting the different patterns of L and S within a given fixed length results in the Fibonacci numbers; the number of patterns that are m short syllables long is the Fibonacci number Fm + 1.[5] Susantha Goonatilake writes that the development of the Fibonacci sequence "is attributed in part to Pingala (200 BC), later being associated with Virahanka (c. 700 AD), Gopla (c. 1135), and Hemachandra (c. 1150)".[3] Parmanand Singh cites Pingala's cryptic formula misrau cha ("the two are mixed") and cites scholars who interpret it in context as saying that the cases for m beats (Fm+1) is obtained by adding a [S] to Fm cases and [L] to the Fm1 cases. He dates Pingala before 450 BCE.[10] However, the clearest exposition of the series arises in the work of Virahanka (c. 700 AD), whose own work is lost, but is available in a quotation by Gopala (c. 1135): Variations of two earlier meters [is the variation]... For example, for [a meter of length] four, variations of meters of two [and] three being mixed, five happens. [works out examples 8, 13, 21]... In this way, the process should be followed in all mAtrA-vr.ttas (prosodic combinations).[11] The series is also discussed by Gopala (before 1135 AD) and by the Jain scholar Hemachandra (c. 1150). In the West, the Fibonacci sequence first appears in the book Liber Abaci (1202) by Leonardo of Pisa, known as Fibonacci.[2] Fibonacci considers the growth of an idealized (biologically unrealistic) rabbit population, assuming that: a newly born pair of rabbits, one male, one female, are put in a field; rabbits are able to mate at the age of one month so that at the end of its second month a female can produce another pair of rabbits; rabbits never die and a mating pair always produces one new pair (one male, one female) every month from the second month on. The puzzle that Fibonacci posed was: how many pairs will there be in one year?

At the end of the first month, they mate, but there is still only 1 pair. At the end of the second month the female produces a new pair, so now there are 2 pairs of rabbits in the field. At the end of the third month, the original female produces a second pair, making 3 pairs in all in the field. At the end of the fourth month, the original female has produced yet another new pair, the female born two months ago produces her first pair also, making 5 pairs.

At the end of the nth month, the number of pairs of rabbits is equal to the number of new pairs (which is the number of pairs in month n 2) plus the number of pairs alive last month (n 1). This is the nth Fibonacci number.[12] The name "Fibonacci sequence" was first used by the 19th-century number theorist douard Lucas.[13] List of Fibonacci numbers The first 21 Fibonacci numbers Fn for n = 0, 1, 2, ..., 20 are:[14]

F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 F12 F13 F14 F15 F16

F17

F18

F19

F20

0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765

The sequence can also be extended to negative index n using the re-arranged recurrence relation

which yields the sequence of "negafibonacci" numbers[15] satisfying

Thus the bidirectional sequence is F8 F7 F6 F5 F4 F3 F2 F1 F0 F1 F2 F3 F4 F5 F6 F7 F8 21 13 8 5 3 2 1 1 0 1 1 2 3 5 8 13 21

Occurrences in mathematics

The Fibonacci numbers are the sums of the "shallow" diagonals (shown in red) of Pascal's triangle. The Fibonacci numbers occur in the sums of "shallow" diagonals in Pascal's triangle (see Binomial coefficient).[16] The Fibonacci numbers can be found in different ways in the sequence of binary strings.

The number of binary strings of length n without consecutive 1s is the Fibonacci number Fn+2. For example, out of the 16 binary strings of length 4, there are F6 = 8 without consecutive 1s they are 0000, 0100, 0010, 0001, 0101, 1000, 1010 and 1001. By symmetry, the number of strings of length n without consecutive 0s is also Fn+2. The number of binary strings of length n without an odd number of consecutive 1s is the Fibonacci number Fn+1. For example, out of the 16 binary strings of length 4, there are F5 = 5 without an odd number of consecutive 1s they are 0000, 0011, 0110, 1100, 1111. The number of binary strings of length n without an even number of consecutive 0s or 1s is 2Fn. For example, out of the 16 binary strings of length 4, there are 2F4 = 6 without an even number of consecutive 0s or 1s they are 0001, 1000, 1110, 0111, 0101, 1010.

Fibonacci's Rabbits The original problem that Fibonacci investigated (in the year 1202) was about how fast rabbits could breed in ideal circumstances. Suppose a newly-born pair of rabbits, one male, one female, are put in a field. Rabbits are able to mate at the age of one month so that at the end of its second month a female can produce another pair of rabbits. Suppose that our rabbits never die and that the female always produces one new pair (one male, one female) every month from the second month on. The puzzle that Fibonacci posed was... How many pairs will there be in one year?

1. At the end of the first month, they mate, but there is still one only 1 pair. 2. At the end of the second month the female produces a new pair, so now there are 2 pairs of rabbits in the field. 3. At the end of the third month, the original female produces a second pair, making 3 pairs in all in the field. 4. At the end of the fourth month, the original female has produced yet another new pair, the female born two months ago produces her first pair also, making 5 pairs.

The number of pairs of rabbits in the field at the start of each month is 1, 1, 2, 3, 5, 8, 13, 21, 34, ... Can you see how the series is formed and how it continues? If not, look at the answer!

The first 300 Fibonacci numbers are here and some questions for you to answer. Now can you see why this is the answer to our Rabbits problem? If not, here's why. Another view of the Rabbit's Family Tree:

Both diagrams above represent the same information. Rabbits have been numbered to enable comparisons and to count them, as follows:

All the rabbits born in the same month are of the same generation and are on the same level in the tree. The rabbits have been uniquely numbered so that in the same generation the new rabbits are numbered in the order of their parent's number. Thus 5, 6 and 7 are the children of 0, 1 and 2 respectively. The rabbits labelled with a Fibonacci number are the children of the original rabbit (0) at the top of the tree. There are a Fibonacci number of new rabbits in each generation, marked with a dot. There are a Fibonacci number of rabbits in total from the top down to any single generation.

There are many other interesting mathematical properties of this tree that are explored in later pages at this site. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

The Rabbits problem is not very realistic, is it? It seems to imply that brother and sisters mate, which, genetically, leads to problems. We can get round this by saying that the female of each pair mates with any male and produces another pair. Another problem which again is not true to life, is that each birth is of exactly two rabbits, one male and one female.

Fibonacci Number Formula The Fibonacci numbers are generated by setting F0=0, F1=1, and then using the recursive formula Fn = Fn-1 + Fn-2 to get the rest. Thus the sequence begins: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... This sequence of Fibonacci numbers arises all over mathematics and also in nature. Tower of Hanoi From Wikipedia, the free encyclopedia Jump to: navigation, search

A model set of the Towers of Hanoi (with 8 disks)

An animated solution of the Tower of Hanoi puzzle for T(4,3). The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower,[1] and sometimes pluralised) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape. The objective of the puzzle is to move the entire stack to another rod, obeying the following rules:

Only one disk may be moved at a time. Each move consists of taking the upper disk from one of the rods and sliding it onto another rod, on top of the other disks that may already be present on that rod. No disk may be placed on top of a smaller disk.

With three disks, the puzzle can be solved in seven moves. Solution The puzzle can be played with any number of disks, although many toy versions have around seven to nine of them. The game seems impossible to many novices, yet is solvable with a simple algorithm.

The number of moves required to solve a Tower of Hanoi puzzle is 2n -1, where n is the number of disks.[4] Iterative solution The following solution is a simple solution for the toy puzzle. Alternate moves between the smallest piece and a non-smallest piece. When moving the smallest piece, always move it to the next position in the same direction (to the right if the starting number of pieces is even, to the left if the starting number of pieces is odd). If there is no tower position in the chosen direction, move the piece to the opposite end, but then continue to move in the correct direction. For example, if you started with three pieces, you would move the smallest piece to the opposite end, then continue in the left direction after that. When the turn is to move the non-smallest piece, there is only one legal move. Doing this will complete the puzzle using the fewest number of moves to do so.[5] It should perhaps be noted that this can be rewritten as a strikingly elegant set of rules: Simpler statement of iterative solution Alternating between the smallest and the next-smallest disks, follow the steps for the appropriate case: For an even number of disks:

make the legal move between pegs A and B make the legal move between pegs A and C make the legal move between pegs B and C repeat until complete

For an odd number of disks:

make the legal move between pegs A and C make the legal move between pegs A and B make the legal move between pegs B and C repeat until complete

In each case, a total of 2n-1 moves are made.

Chairs in a row: The Teachers version

This time we have n chairs in a row and a roomful of people.

If you've ever been to a gathering where there are teachers present, you will know they always talk about their school/college (boring!). So we will insist that no two teachers should sit next to each other along a row of seats and count how many ways we can seat n people, if some are teachers (who cannot be next to each other) and some are not . The number of seating arrangements is always a Fibonacci number:
1 chair or 2 ways

2 chairs

or

or

3 ways

since we do not allow 3 chairs this time , , , , and or are not allowed. 5 ways

You can write the sequences using T for Teacher and N for Normal people - oops - I mean Not-a-teacher !!

There will always be a Fibonacci number of sequences for a given number of chairs, if no two teachers are allowed to sit next to each other!

Chairs in a Row: The Friendly Version

This variation is a little friendlier to teachers. Everyone, teacher or not , must not sit on their own, but a teacher teacher and a non-teacher must be next to a non-teacher . must be next to another

So we can have ... ... since the two teachers have the other teacher next to them. The non-teacher on the right of these 3 will now also need another non-teacher on his other side so that he too is not left on his own. A special extracondition in this puzzle is that any seating arrangement must also start with a teacher!
1 chair: 2 chairs: 3 chairs: 4 chairs: 5 chairs: or or or 0 ways 1 way 1 way 2 ways 3 ways

There will always be a Fibonacci number of arrangements if we start with a teacher.

What happens if we start with a non-teacher always? What happens if we have no restriction on the first seat? The answers to these two questions also involve the Fibonacci numbers too!! The Fibonacci sequence satisfies F0=F1=1 and the recurrence relation Fk=Fk1+Fk2 for all integers k2. Prove that Fk+2FkF2k+1=(1)k for all integers k0.