Money Dealing Strategies - Find Recurrence Relation

  • Thread starter Thread starter Goldenwind
  • Start date Start date
  • Tags Tags
    Money
Click For Summary
SUMMARY

The discussion focuses on finding a recurrence relation for calculating the number of ways to pay a bill using various denominations of coins and bills in a currency system. The currency includes coins of 1, 2, 5, and 10 pesos, and bills of 5, 10, 20, 50, and 100 pesos. A user shares their approach to the problem, likening it to providing change in a vending machine, while another user references a helpful resource that outlines similar recurrence relation problems. The textbook example provided indicates that for n = 17 pesos, there are 9494 distinct ways to make the payment.

PREREQUISITES
  • Understanding of recurrence relations in mathematics
  • Familiarity with combinatorial counting techniques
  • Basic programming skills, particularly in Java
  • Knowledge of currency systems and denominations
NEXT STEPS
  • Study recurrence relations in combinatorial mathematics
  • Learn how to implement recursive algorithms in Java
  • Explore dynamic programming techniques for counting problems
  • Review the textbook resource on recurrence relations for practical examples
USEFUL FOR

Students in mathematics or computer science, particularly those studying combinatorics or algorithms, as well as educators looking for examples of recurrence relations in real-world applications.

Goldenwind
Messages
145
Reaction score
0

Homework Statement


A country uses as currency coins with values of 1 peso, 2 pesos, 5 pesos, and 10 pesos and bills with values of 5 pesos, 10 pesos, 20 pesos, 50 pesos, and 100 pesos. Find a recurrence relation for the number of ways to pay a bill of n pesos if the order in which the coins and bills are paid matters.

Reminder: I'm just asking for a hint, DO NOT solve this.

Homework Equations


To see an example of a recurrence relation, see my other thread.

The Attempt at a Solution


If I were approaching this in real life, I'd think of it like vending change after a customer bought something.

Say their change is 588 pesos.
I'd give them five 100 pesos bills, still owing 88 pesos.
Then give one 50 pesos bill, still owing 38 pesos.
Then give one 20 pesos bill, still owing 18 pesos.
Then give one 10 pesos bill/coin, still owing 8 pesos.
Then give one 5 pesos bill/coin, still owing 3 pesos.
Then give one 2 pesos coin, still owing 1 pesos.
Then give one 1 pesos coin.

But this is just one way. There are many, many, many other ways to do this, such as 588x1Pesos, 294x2Pesos, (5x100Pesos + 44x2Pesos), and so on.

I could program this in Java, using a method and multiple "Is a > b?" conditions, but clueless as to how to do this in a recursive formula [itex]a_n[/itex].

Another reminder: Hint only, don't solve.
 
Physics news on Phys.org
Hi Goldenwind

Funny coincidence, but I've been dealing with the exact same problem and in fact I think I am in the same class as you because I have seen your posts before. I did manage to find a solution earlier on, and the resource I looked at that helped me is in the following link:

http://books.google.ca/books?id=vIf...OEjAG6n_jdBg&sig=wWKIPPcJCJaNT4r4nAXEPVXeHK8"

That text deals with a similar problem and I found it helpful. Also note that in the answers section of the textbook it shows that for when n = 17, the result will be 9494, so if you feel like writing out all the terms (or if you're like me, you'd write a computer program to do it for you) you have a rough means of checking your answer.

I hope I didn't just scare you to death. Good luck with the problem.
 
Last edited by a moderator:

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 13 ·
Replies
13
Views
5K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 28 ·
Replies
28
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
4
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 73 ·
3
Replies
73
Views
11K
  • · Replies 3 ·
Replies
3
Views
2K