- #1

r0bHadz

- 194

- 17

## Homework Statement

I'm suppose to find the # of ways to climb n stairs if a person can take 1 stair or 2 stairs at a time. The question is:

"

Find a recurrence relation for the number of ways to

climb n stairs if the person climbing the stairs can take

one stair or two stairs at a time."

## Homework Equations

## The Attempt at a Solution

I'm just confused as to why a_0 = 1. This makes no sense to me.

If there are 0 stairs to climb, I don't consider the action of "do nothing" to fulfill "the # of ways to climb n stairs"

Can anyone break this down for me logically?

Last edited: