推 sasbluesea:Fibonacci 04/11 15:03
推 loveeveryone:n-digit令為Fn 04/11 18:36
→ loveeveryone:分為以下兩種情形 04/11 18:37
→ loveeveryone:最尾巴位元不為0 ----> F n-1 04/11 18:38
→ loveeveryone:尾巴位元為0 ------> F n-2 04/11 18:39
→ loveeveryone:所以 Fn = Fn-1 + Fn-2 04/11 18:40
→ ooopppeeennn:那如果題目把binary改成ternary呢? 04/11 18:55
推 sasbluesea:如果還是只有0不能連續的話應該是F(n)=F(n-1)+2F(n-2) 04/11 22:14