Add new comment


To reach n, i should first reach n-2 or n-1; and to reach n-2, i should reach n-3 or n-2.
Considering this, i will get:

F(n) = F(n-1)+F(n-2)
F(n-1) = F(n-2)+F(n-3)

This means to reach the n-th step, the number of ways is a Fibonacci number F(n).

By the way, F(10) = 89.

Filtered HTML

  • Web page addresses and email addresses turn into links automatically.
  • Allowed HTML tags: <a href hreflang> <em> <strong> <cite> <code> <ul type> <ol start type> <li> <dl> <dt> <dd>
  • Lines and paragraphs break automatically.
  • Want facts and want them fast? Our Maths in a minute series explores key mathematical concepts in just a few words.