Problem 5. A vending machine dispensing books of stamps accepts only $1 coins, $1 bills, and $2 bills. Let an denote the number of ways of depositing n dollars in the vending machine, where the order in which the coins and bills are deposited matters. (a) Find a recurrence relation for an and give the necessary initial condition(s). (b) Find an explicit formula for an by solving the recurrence relation in part (a).

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter4: Eigenvalues And Eigenvectors
Section4.6: Applications And The Perron-frobenius Theorem
Problem 57EQ
icon
Related questions
Question
Problem 5. A vending machine dispensing books of stamps accepts only $1 coins, $1 bills, and $2 bills. Let
an denote the number of ways of depositing n dollars in the vending machine, where the order in which
the coins and bills are deposited matters.
(a) Find a recurrence relation for an and give the necessary initial condition(s).
(b) Find an explicit formula for an by solving the recurrence relation in part (a).
Transcribed Image Text:Problem 5. A vending machine dispensing books of stamps accepts only $1 coins, $1 bills, and $2 bills. Let an denote the number of ways of depositing n dollars in the vending machine, where the order in which the coins and bills are deposited matters. (a) Find a recurrence relation for an and give the necessary initial condition(s). (b) Find an explicit formula for an by solving the recurrence relation in part (a).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer