Prof. S. Brick Discrete Math; Quiz 7 Math 267
Fall ’02 section 1
0. Print your name:
1. Find a recurrence relation with initial conditions for the number of ways a person can
climb nstairs if he can take either one stair or two stairs at a time
2. Find a recurrence relation with initial conditions for the number of ternary strings that
do not contain two consecutive zeroes.
3. A candy vending machine accepts nickels, dimes, and quarters (the dollar slot is broken).
Give a recurrence relation with initial conditions for the number of ways of depositing n
cents, where the order of the coins matters.