1 2 3 5 8 13 2 1 34 55 89 ...
As a typical topic in this series, your topic is also very famous in history.
If your child masters this series, it will be of great benefit to him.
The law of sequence is that the next term is equal to the sum of this term and the previous term.
The recursive function is f (n+1) = f (n)+f (n-1), and there is no general term formula of elementary function.
Of course, your child has never learned series and functions. You can just tell him what to think and go around.
Those mathematical symbols.
Let's go back to this topic:
The nth term of Fibonacci series is the total number of times of taking N stairs.
1 There is naturally only one way for stairs.
There are naturally two ways to use the secondary stairs.
...
When taking N stairs, you can take 1 first, and there are n- 1 stairs left below.
You can also take two steps first, and there are n-2 stairs left below.
Therefore, the total number of methods for N stairs is n- 1 stairs plus n-2 stairs.
Number of stairs. This is the essence of this method and this series.
Specifically, it is
The third staircase is equal to 1 staircase method number plus 2 staircase method number 1+2 = 3.
Four stairs is equal to the number of two stairs plus the number of three stairs 2+3 = 5.
The next five stairs 3+5 = 8.
6 Stairs 5+8 = 13
7 Stairs 8+ 13 = 2 1
8 stairs 13+2 1=34
9 Stairs 2 1+34 = 55
10 staircase 34+55 = 89