The Fibonacci sequence Fn is defined as follows:
F1=F2=1,F(n+2)=F(n+1)+Fn where n is any natural number.
Prove that for any natural numbers n and k greater or equal to 3, F(kn) is a
multiple of Fk
Hint:Show that F(kn)=Fs．F(kn-s+1)+F(s-1)．F(kn-s) where 2 smaller than
or equal to s, s smaller than or equal to k
一題mathematical induction
2010-08-27 2:51 pm
回答 (3)
2010-08-28 5:36 am
✔ 最佳答案
==========================================================圖片參考：http://img836.imageshack.us/img836/7029/45737700.png
2010-08-27 21:36:54 補充：
http://img836.imageshack.us/img836/7029/45737700.png
2010-08-27 10:57 pm
但係題目話prove,應該唔係correction
2010-08-27 4:40 pm
are you asking a correction? so many unknown
收錄日期: 2021-04-23 23:21:26
原文連結 [永久失效]:
https://hk.answers.yahoo.com/question/index?qid=20100827000051KK00243