Mathematics Homework Solutions
Problem
#110996

Recurrence Relation

A vending machine accepts only pennies and nickels.
a) Find a recurrence relation for the number of ways to deposit n cents where the order in which coins are deposited matters.
b) What are the initial conditions for the recurrence?
c) Use the recurrence to count the number of ways to deposit 12 cents.


Solution Summary

A recurrence relation is investigated. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.

Solution
What is this?
By OTA - Overall OTA Rating
Yupei Xiong, PhD - 4.8/5
Purchase Cost Now
$2.19 CAD (was ~$23.94)
Included in Download
  • Plain text response
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • General solutions to recurrence relations. - I need to find the general solution for the following recurrence relation but in a form that doesn't contain complex numbers. a_{n+2}+2a_{n+1}+5a_n = 0
  • Recurrence Relations - Solve the recurrence relation a(n)=3a(n-1)+10a(n-2) with the initial conditions a(0)=0 and a(1)=2. Solve the recurrence relation a(n)=3a(n-1)+10a(n-2) +12 with the initial conditions a(0)=0 and a(1 ...
  • Solutions of Recurrence Relations - Consider the recurrence relation . Show that the general solution is . Show that the solution with starting values and corresponds to and . Please see the attached file for the f ...
  • Solving a Recurrence Relation - Solve the recurrence relation: a(n) = 3a(n-1) - 3 a(n-2) + a(n-3), a0=1, a1=1, a2=2 -where the value in brackets reads sub. a(n) is 'a' subscript 'n'
  • Series Convergence of a Recurrence Relation - Prove that the series given by the recurrence relation a_n+1 = SQRT(3*a_n), where a_1 = 4, converges, and find the limit of convergence.
Browse