mobile wallpaper 1mobile wallpaper 2mobile wallpaper 3mobile wallpaper 4
17 words
1 minute
斐波那契数列
2025-11-09

斐波那契数列:

通项公式(不用记):

F(n)=F(n1)+F(n2) (n2,nN,F(0)=1,F(1)=1)F(n)=F(n-1)+F(n-2) \ (n\geq 2,n \in N^*,F(0)=1,F(1)=1) [F(n)F(n1)]=[1110][F(n1)F(n2)]\begin{bmatrix} F(n) \\ F(n-1) \end{bmatrix} = \begin{bmatrix} 1 & 1 \\ 1 & 0 \end{bmatrix} \begin{bmatrix} F(n-1) \\ F(n-2) \end{bmatrix} an=15[(1+52)n(152)n]a_n=\frac{1}{\sqrt{5}}[(\frac{1+\sqrt{5}}{2})^n-(\frac{1-\sqrt{5}}{2})^n] [F(n)F(n1)]=[1110]n1[10]\begin{bmatrix} F(n) \\ F(n-1) \end{bmatrix} = \begin{bmatrix} 1 & 1 \\ 1 & 0 \end{bmatrix} ^{n-1} \begin{bmatrix} 1 \\ 0 \end{bmatrix}
Share

If this article helped you, please share it with others!

斐波那契数列
https://blog.vanilla.net.cn/posts/笔记/斐波那契数列/
Author
星夜
Published at
2025-11-09
License
CC BY-NC-SA 4.0

Some information may be outdated

Table of Contents