On the Generalized Climbing Stairs Problem

Details On the Generalized Climbing Stairs Problem On the Generalized Climbing Stairs Problem

2009-09-29

arxiv.org/abs/0909.5459v1

Mathematics

Combinatorics

Scientific paper

Let $\mathcal S$ be a subset of the positive integers, and $M$ be a positive integer. Mohammad K. Azarian, inspired by work of Tony Colledge, considered the number of ways to climb a staircase containing $n$ stairs using "step-sizes" $s \in \mathcal S$ and multiplicities at most $M$. In this exposition, we find a solution via generating functions, i.e., an expression which counts the number of partitions $n = \sum_{s \in \mathcal S} m_s s$ satisfying $0 \leq m_s \leq M$. We then use this result to answer a series of questions posed by Azarian, thereby showing a link with ten sequences listed in the On-Line Encyclopedia of Integer Sequences. We conclude by posing open questions which seek to count the number of compositions of $n$.

Affiliated with

Also associated with

No associations

Rating

On the Generalized Climbing Stairs Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Generalized Climbing Stairs Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Generalized Climbing Stairs Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-587960