Bilangan Fibonacci

Dari Wikipedia bahasa Indonesia, ensiklopedia bebas

Dalam matematika, bilangan Fibonacci adalah barisan yang didefinisikan secara rekursif
sebagai berikut:

Penjelasan: barisan ini berawal dari 0 dan 1, kemudian angka berikutnya didapat dengan cara
menambahkan kedua bilangan yang berurutan sebelumnya. Dengan aturan ini, maka barisan
bilangan Fibonaccci yang pertama adalah:

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

Barisan bilangan Fibonacci dapat dinyatakan sebagai berikut:

Fn = (x1n – x2n)/ sqrt(5)

dengan

 Fn adalah bilangan Fibonacci ke-n

 x1 dan x2 adalah penyelesaian persamaan x2-x-1=0

Perbandingan antara Fn+1 dengan Fn hampir selalu sama untuk sebarang nilai n dan mulai nilai n
tertentu, perbandingan ini nilainya tetap. Perbandingan itu disebut Golden Ratio yang nilainya
mendekati 1,618.

Pengaturan lantai dengan kotak berukuran bilangan Fibonacci

[sunting] Asal mula

Berdasarkan buku The Art of Computer Programming karya Donald E. Knuth, barisan ini
pertama kali dijelaskan oleh matematikawan India, Gopala dan Hemachandra pada tahun 1150,
ketika menyelidiki berbagai kemungkinan untuk memasukkan barang-barang ke dalam kantong.
Di dunia barat, barisan ini pertama kali dipelajari oleh Leonardo da Pisa, yang juga dikenal
sebagai Fibonacci (sekitar 1200), ketika membahas pertumbuhan ideal dari populasi kelinci.

Leonardo da Pisa
Dari Wikipedia bahasa Indonesia, ensiklopedia bebas
Belum Diperiksa
Artikel ini perlu dirapikan agar memenuhi standar Wikipedia
Merapikan artikel bisa berupa membagi artikel ke dalam paragraf atau wikifikasi artikel. Setelah
dirapikan, tolong hapus pesan ini.

Leonardo da Pisa atau Leonardo Pisano (1175 - 1250), dikenal juga sebagai Fibonacci, adalah
seorang matematikawan Italia yang dikenal sebagai penemu bilangan Fibonacci dan perannya
dalam mengenalkan sistem penulisan dan perhitungan bilangan Arab ke dunia Eropa (algorisma).

Bapak dari Leonardo, Guilielmo (William) mempunyai nama alias Bonacci ('bersifat baik' atau
'sederhana'). Leonardo, setelah meninggal, sering disebut sebagai Fibonacci (dari kata filius
Bonacci, anak dari Bonacci). William memimpin sebuah pos perdagangan (beberapa catatan
menyebutkan ia adalah perwakilan dagang untuk Pisa) di Bugia, Afrika Utara (sekarang Bejaia,
Aljazair), dan sebagai anak muda, Leonardo berkelana ke sana untuk menolong ayahnya. Di
sanalah Fibonacci belajar tentang sistem bilangan Arab.

Melihat sistem bilangan Arab lebih sederhana dan efisien dibandingkan bilangan Romawi,
Fibonacci kemudian berkelana ke penjuru daerah Mediterania untuk belajar kepada
matematikawan Arab yang terkenal mada masa itu, dan baru pulang kembali sekitar tahun 1200-
an. Pada 1202, di usia 27, ia menuliskan apa yang telah dipelajari dalam buku Liber Abaci, atau
Buku Perhitungan. Buku ini menunjukkan kepraktisan sistem bilangan Arab dengan cara
menerapkannya ke dalam pembukuan dagang, konversi berbagai ukuran dan berat, perhitungan
bunga, pertukaran uang dan berbagai aplikasi lainnya. Buku ini disambut baik oleh kaum
terpelajar Eropa, dan menghasilkan dampak yang penting kepada pemikiran Eropa, meski
penggunaannya baru menyebarluas setelah ditemukannya percetakan sekitar tiga abad
berikutnya. (Contohnya, peta dunia Ptolemaus tahun 1482 dicetak oleh Lienhart Holle di Ulm.)

Leonardo pernah menjadi tamu Kaisar Frederick II, yang juga gemar sains dan matematika.
Tahun 1240 Republik Pisa memberi penghormatan kepada Leonardo, dengan memberikannya
gaji.
Fibonacci: Great Italian Mathematician
 Heroes-villains

A Leap in Mathematics

Fibonacci Statue

The Middle Ages were generally a dark time for most cultural endeavors, but especially for
mathematics. Fortunately, around the beginning of the 1200's an Italian by the name of Leonardo
Pisano came along to advanced mathematics significantly - he wrote many books on numerical
topics that included his own insightful contributions. For someone to come out of the Middle
Ages and accomplish this when no other scholar was doing so adequately demonstrates the
genius of Leonardo Pisano. And the strangest thing is that today we know this man by a
completely different name: Fibonacci.

There has been some general confusion regarding Fibonacci's name throughout the years, but
here are a few facts: He was born in Pisa, (where the famous tower is located) in 1170 as
Leonard Pisano. His father's name was Guglielmo but he also had the nickname of Bonacci,
which means "the good-natured one" (some biographies say Guglielmo was a "member of the
Bonacci family," implying it was more than just a nickname...) and thus Leonardo received his
own nickname of Fibonacci due to filius Bonacci, which means "son of the good-natured one."

Throughout his life Fibonacci was mainly known as a wealthy merchant with an intense interest
in numbers. He was educated in Algeria, where his father worked as a customs officer. In his
youth, while staying with his father in Bugia (now Bejaia) Algeria, Fibonacci was first exposed
to Arabic numerals (1, 2, 3, 4, 5, 6, 7, 8, 9 and 0), which we of course use today. He quickly
mastered their idea and continued employing them after his return to Italy. In 1202 he completed
his work, Liber abaci (1202) "Book of Calculation" in which he explained how to use Arabic
numerals and also noted their advantages. Although today we know he wrote many texts on
mathematics, the only ones that have survived are his Practica geometriae (1220), Liber abaci
(1202), Liber quadratorum (1225), and Flos (1225). Because printing had not been invented
during Fibonacci's lifetime, his books had to be handwritten. Hence only very few copies of his
texts were ever made and we are lucky to have any at all.

Today Fibonacci's name is associated with one of the most famous and important sequences in
number theory. Many educated people have more than likely heard of Fibonacci numbers even
though they may not recall precisely how they are defined. In his book, Liber abaci, Fibonacci
first poses the following problem (it has been reworded), which produces the famous Fibonacci
sequence.

Start with a single pair of rabbits. Any pair of rabbits of one generation will produce a pair for
the next generation, and then another pair of rabbits for the generation after that. But then they
will die. How many rabbits will be produced in the n-th generation?

The answer is the famous Fibonacci sequence:

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946,
17711, 28657, 46368...

But it doesn't only arise in the rabbit population problem (although of course in real life rabbits
do not follow the rules stated above). It turns up in many different areas of nature: on the sides of
pineapples, the ridges of pine cones, the centers of sunflowers; numerous areas of phyllotaxis all
employ the Fibonacci numbers (phyllotaxis being the botanical definition for a plant's
arrangement of leaves). The sequence above also has a deceptively simple formula. To produce
the n-th term, simply add the two previous terms of the sequence: 1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5,
etc. Mathematically, the formula can be written: F1 = 1, F2 = 1, Fn + 1 = Fn + Fn - 1.

Thousands of properties, results, and theorems relating to Fibonacci's sequence have been
discovered. There is even a mathematical journal devoted solely to its study called The Fibonacci
Quarterly. But an interesting fact is that the Fibonacci sequence only became famous during the
late nineteenth century after the mathematician Edouard Lucas gave it its present name and wrote
about its properties in his book Theorie des nombres.

Liber abaci is perhaps Fibonacci's most famous work. The book is devoted to arithmetic and
various linear equations; but with it he also introduced the Hindu-Arabic number system to
Europe; and included a table of prime numbers from 10 to 100; he also made the observation that
when testing a prime number, the only thing necessary is to divide by all primes up to the square
root of the number (the first known type of primality test). He also discusses perfect numbers, the
Chinese remainder theorem, algebra problems, how to sum geometric series, and various
problems useful to merchants.

Speaking of prime numbers (integers divisible only by themselves and one) there are Fibonacci
numbers that are also primes. Here are the first few values of n such that Fn is prime: 3, 5, 7, 11,
13, 17, 23, 29, 43, 47, 83, 131, 137, 359, 431, 433, 449, 509, 569, 571, 2971, 4723, 5387, 9311,
9677, 14431, .. With the currently known largest one being n = 604711, found by Henri Lifchitz
in November of 2005, which has 126,377 digits (and is actually a probable prime since Fibonacci
numbers do not have an easily provable form).

Fibonacci was also recognized by politicians and other non-mathematicians in his time. In fact
the Republic of Pisa awarded him a salary in honor of the ongoing accounting advice he
provided the city, as well as the teaching he had given citizens over the years. The decree issued
by the Republic addressed Fibonacci as "... the serious and learned Master Leonardo Bigollo..."
(Bigollo is today thought to mean "traveler," yet another name Fibonacci was known by!).

Even though Liber abaci is important because of the effect Arabic numerals had on Western
Civilization, his most impressive book is probably Liber quadratorum (1225), which is "Book of
Squares." It's a text on number theory and the first major contribution to that field between the
time of Diophantus (200 - 284) and the time of Fermat (1601 - 1665). It contains mostly results
on square numbers (obviously), such as the observation that squares can be built up from sums of
odd numbers, and discusses ways to find Pythagorean triples.

We do not know very much about Fibonacci's personal life. E.g., if he was married or had any
children. No one is even certain as to how he died. Nevertheless a statue was recently erected in
the Giardino Scotto in honor of the greatest mathematician to come out of the Middle Ages.

Now we will close this article by listing five fairly easy-to-understand results concerning
Fibonacci numbers.

1. The ratio of consecutive Fibonacci numbers approaches the "golden number" Phi:

(1+sqrt(5))/2 = 1.618033988749...

For example, Fibonacci(30) = 832040 and Fibonacci(29) = 514229 and 832040/514229 =

1.618033988748...

2. The final units digits (in bold) of the Fibonacci numbers repeat forever in a cycle of 60:

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, ...
3. It has been proved (although I don't know by whom) that Fibonacci(n) + 1 is always
composite for any n >= 4. So if we let B(n) equal the number of prime divisors of n, counting
also those that repeat, we get the following sequence for B(Fibonacci(n)+1), in which every term
from the fourth onward will always be greater than 1.

1, 1, 1, 2, 2, 2, 2, 2, 2, 4, 4, 2, 4, 5, 2, 4, 3, 3, 4, 3, 3, 8, 4, 2, 4, 5, 3, 5, 5, 5, 4, 4, 2, 6, 6, 2, 7,

9, 4, 6, 5, 4, 6, 5, 4, 12, 4, 4, 6, 5, 5, 7, 6, 6, 7, 6, 4, 10, 6, 2, 7, 9, 4, 6, 5, 4, 6, 7, 6, 13, 7, ...

4. Take a set of Fibonacci numbers from Fibonacci(1), Fibonacci(2), Fibonacci(3), ... , and
Fibonacci s(2*n). Now choose n + 1 of them. One of the chosen numbers will always divide
another from the set evenly. For example, let's take N = 6. The first twelve Fibonacci numbers
are 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144. Now let's choose the last seven terms 8, 13, 21, 34, 55,
89, 144, and see if one divides another evenly. Choosing 144 and dividing by 8 gives: 144/8 =
18. So there we have it.

5. Fibonacci numbers are also related to the decimal expansion of 1/89, which you can see in the
arrangement of decimal fractions below.

1. .01
2. .001
3. .0002
4. .00003
5. .000005
6. .0000008
7. .00000013
8. .000000021
9. .0000000034
10. - - - - - - - -
11. .01123595505...

By Jason Earls