Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 8 - Section 8.1 - Applications of Recurrence Relations - Exercises - Page 510: 4

Answer

$a_n = a_{n-1}+ a_{n-2} + 2 \times a_{n-5} + 2 \times a_{n-10} + a_{n-20} + a_{n-50} + a_{n-100}$

Work Step by Step

For $n\geq100$ , We have to find $a_n$, where $a_n$ denotes the number of ways the payment can be made. We could pay a 1 dollar coin and pay the rest in $a_{n-1}$ ways or, we could pay a 2 dollar coin and pay the rest in $a_{n-2}$ ways or, we could pay a 5 dollar coin and pay the rest in $a_{n-5}$ ways.or, we could pay a 5 dollar bill and pay the rest in $a_{n-5}$ ways or, we could pay a 10 dollar coin and pay the rest in $a_{n-10}$ ways or, we could pay a 10 dollar bill and pay the rest in $a_{n-10}$ ways or, we could pay a 20 dollar bill and pay the rest in $a_{n-20}$ ways or, we could pay a 50 dollar bill and pay the rest in $a_{n-50}$ ways or, we could pay a 100 dollar bill and pay the rest in $a_{n-100}$ ways. This all totals up to the number of ways we can pay n dollar. Therefore, $a_n = a_{n-1}+ a_{n-2} +a_{n-5}+ a_{n-5} + a_{n-10}+ a_{n-10} + a_{n-20} + a_{n-50} + a_{n-100}$ Or $a_n = a_{n-1}+ a_{n-2} + 2 \times a_{n-5} + 2 \times a_{n-10} + a_{n-20} + a_{n-50} + a_{n-100}$
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.