Difference between revisions 3684385 and 3684386 on mswiki

< previous diff
next diff >
Nombor Fibonacci
{{pelbagai isu|{{cleanup|reason=memerlukan penterjemahan segera kerana sudah ditinggalkan sejak tahun 2008|date=Ogos 2014}}{{Terjemah|en|fabonacci number|date=Ogos 2014}}}}
{{proses|BukanTeamBiasa}}
[[Image:FibonacciBlocks.svg|thumb|180px|right|Suatu ubinan dengan segi empat yang tepinya adalah nombor Fibonaci berturut-turut pada panjangnya]]
(contracted; show full)
''F''(''n'') can be interpreted as the number of ways summing 1's and 2's to ''n'' &minus; 1, with the convention that ''F''(0) = 0, meaning no sum will add up to &minus;1, and that ''F''(1) = 1, meaning the empty sum will "add up" to 0.
Here the order of the summands matters.
For example, 1 + 2 and 2 + 1 are considered two different sums and are counted twice.

=== 
First IdentityPengenalan Pertama ===

:<big><math>F_{n+1} = F_{n} + F_{n-1}</math></big>

:''The nthNombor Fibonacci number is the sum of the previous twoke-n adalah jumlah dua nombor Fibonacci numberssebelumnya.''

==== Proof embuktian====

We must establish that the sequence of numbers defined by the combinatorial interpretation above satisfy the same recurrence relation as the Fibonacci numbers (and so are indeed identical to the Fibonacci numbers).

(contracted; show full)
*[http://web.archive.org/web/20070715032716/http://mathdl.maa.org/convergence/1/?pa=content&sa=viewDocument&nodeId=630&bodyId=1002 Fibonacci Numbers] at [http://web.archive.org/web/20060212072618/http://mathdl.maa.org/convergence/1/ Convergence]
* [http://www.tools4noobs.com/online_tools/fibonacci/ Online Fibonacci calculator]

[[Kategori:Fibonacci numbers|*]]
[[Kategori:Articles containing proofs]]

<!-- interwiki -->