Difference between revisions 3684384 and 3684385 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)n the first set. The second set contains those sums whose first summand is 2; the remainder sums to ''n''&minus;2, so there are ''F''(''n''&minus;1) sums in the second set. The first summand can only be 1 or 2, so these two sets exhaust the original set. Thus ''F''(''n''+1) = ''F''(''n'') + ''F''(''n''&minus;1).

=== 
Second IdentityPengenalan Kedua ===

:<math>\sum_{i=0}^n F_i = F_{n+2} - 1</math>

:''Jumlah bagi n pertama nombor Fibonacci adalah nombor Fibonacci ke-(n+2) tolak 1.''

==== Proof ====

(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 -->