The movement times of the first floor are 1, the second floor is 2, the third floor is 1+2=3, and the fourth floor is 2+3=5, and so on.
1 2 3 5 8 13 2 1 34 55 89 .......
So there are 89 ways to walk on the tenth floor.
Mathematical practice:
Let the array An represent how many paths there are in step n, and the topic is to find A 10.
There are two ways to get to An, from n- 1 to 1 and from n-2 to 2, and then
Relationship: An = A(n- 1)+A(n-2) Fibonacci sequence.
Please go.
There is a formula that says:
Let the general term of Fibonacci sequence be one.
An = (p n-q n)/√ 5, where p = (√ 5- 1)/2 and q = (√ 5+ 1)/2.