One might ask them self, 'how do I climb a flight of stairs?' I am looking for the number of ways to climb these stairs f(x). so I can either climb 1 step (N-1) or I can climb 2 steps (N-2).
One might ask them self, 'how do I climb a flight of stairs?' I'm letting (n) be the number of steps I can take in figuring out how many ways I can climb the flight of stairs f(n). I can either take 1 or 2 steps at a time from either the (n-1) step or the (n-2) step. The Fibonacci sequence can be rewritten as f(n)=f(n-1)+f(n-2) where n>2.
I can climb the stairs by taking 1 step at a time f(1)=1, or I can climb 2 steps in two ways because f(2)=2 (1, 1, 2). A solution to this problem is defined through the fibonacci sequence of 1, 1, 2, 3, 5, 8, 13, etc..
I used http://ms.appliedprobability.org/data/files/Articles%2033/33-1-5.pdf as a resource to make sure I had the right idea.
One might ask them self, 'how do I climb a flight of stairs?' I am looking for the number of ways to climb these stairs f(x). so I can either climb 1 step (N-1) or I can climb 2 steps (N-2).
ReplyDeleteF(N)=F(N−1)+F(N−2)
To be continued
Computer died...
DeleteSo as I was saying;
One might ask them self, 'how do I climb a flight of stairs?' I'm letting (n) be the number of steps I can take in figuring out how many ways I can climb the flight of stairs f(n). I can either take 1 or 2 steps at a time from either the (n-1) step or the (n-2) step. The Fibonacci sequence can be rewritten as f(n)=f(n-1)+f(n-2) where n>2.
I can climb the stairs by taking 1 step at a time f(1)=1, or I can climb 2 steps in two ways because f(2)=2 (1, 1, 2). A solution to this problem is defined through the fibonacci sequence of 1, 1, 2, 3, 5, 8, 13, etc..
I used http://ms.appliedprobability.org/data/files/Articles%2033/33-1-5.pdf as a resource to make sure I had the right idea.