n 番目のフィボナッチ数 F(n) を計算 F(0) = 0, F(1) = 1, F(n+2) = F(n+1) + F(n)
F(0) = 0, F(1) = 1, F(n+2) = F(n+1) + F(n)
⇒ 列挙
n = 計算 行列演算
| Java | Python |
![[[1 1] [1 0]]^n = [[F(n+1) F(n)] [F(n) F(n-1)]]](../img/fibm.png){kind=small}