Purchase Solution

Using the Recurrence Relation in algebra

Not what you're looking for?

Ask Custom Question

Bob deposits quarters and dollar bills into a vending machine to buy snacks. Find a recurrence relation for the number of ways he can deposit 25*n cents into the machine if the order matters. State the recurrence relation and the initial conditions. Then use your recurrence relation to find the number of ways Bob can deposit $3.25.

Purchase this Solution
Solution Summary

The expert uses recurrence relations in algebra.

Solution Preview

Let n= # quarters
m= # dollar bills
Then we have the recurrence formula:

.25n + m = 3.25

If we multiply this by 100, we ...

Solution provided by:
Chris Busu, PhD (IP)
Education
  • BSc, University of Bucharest
  • MSc, Ovidius
  • MSc, Stony Brook
  • PhD (IP), Stony Brook
Recent Feedback
  • "Thank you "
  • "Thank You Chris this draft really helped me understand correlation."
  • "Thanks for the prompt return. Going into the last meeting tonight before submission. "
  • "Thank you for your promptness and great work. This will serve as a great guideline to assist with the completion of our project."
  • "Thanks for the product. It is an excellent guideline for the group. "
Purchase this Solution
Free BrainMass Quizzes
Probability Quiz

Some questions on probability

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

View More Free Quizzes
Related BrainMass Solutions

  • Fibonacci sequence in closed form

    Proved Hence the recurrence relationship is true for all m = 2, 3, .... The Fibonacci sequence in closed forms are given. The recurrence relation is examined.

  • Solutions of Recurrence Relations

    Please see the attached file for the fully formatted problems. Please see the attached file for the complete solution. Thanks for using BrainMass. Problem Consider the recurrence relation . Show that the general solution is .

  • General solution to a recurrence relation.

    80372 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.

  • Recurrence Relations : Lines and Planes; Savings and Interest; n-Digit Ternary Sequences

    5) Find and solve a recurrence relation for the number of n-digit ternary sequences in which no 1 appears to the right of any 2. Please see the attached file for the complete solution. Thanks for using BrainMass.

  • Recurrence Relation

    Solve the recurrence relation a(n)=3a(n-1)+10a(n-2) +12 with the initial conditions a(0)=0 and a(1)=2. For a particular solution, try a(n)=C, a constant. Please see the attached file for the complete solution. Thanks for using BrainMass.

  • solving the recurrence relation

    106873 Recurrence relation 1. If a person invests in a tax-sheltered annuity, the money invested, as well as the interest earned, is not subject to taxation until withdrawn from the account.

  • Find a recurrence relation and associated generating function for the number of n-digit ternary sequence that have the pattern "012" occurring for the first time at end of the sequence. 3.

  • Recurrence relations, compound interest, polynomials, number of combinations, & iteration

    Prove by mathematical induction that 4(2n) +3 is a solution to the recurrence relation sn = 2sn-1 -3 for n ≥ 1 with the initial condition s0 = 7 Please see the attached file for the solution in a Word Doc.

  • Recursive and Recurrence

    (please see the attached file) 3. Find a solution to the recurrence relation: (please see the attached file) We claim that the solution to this recurrence relation is: (please see the attached file) (1) We show this by induction.

View More Related Solutions