Coin problem - all possible amounts from a set of coins

  • Thread starter musicgold
  • Start date
  • #1
musicgold
304
19
Homework Statement
Given 8 dimes (10 ¢ coins) and 3 quarters (25 ¢ coins), how many different amounts
of money can be created using one or more of the 11 coins?
Relevant Equations
m = 10d + 25q , where 0 <= d < 9 and 0 <= q < 4
where d is number of dimes and q is number of quarters used to get a m.
While I found 26 possible values of m with the trial and error method, I wanted to find an elegant approach to solve such problems.

I think the following equation represents the problem:
m = 10d + 25q where ## 0 <= d < 9 ## and ## 0 <= q < 4 ##
where d is the number of dimes and q is number of quarters used to get a m.

As d can take 9 values and q can take 4 values, m can take 36 possible values, some of which will be duplicate. Note that the combination d=0, q= 0 is invalid.

I am not able to find a way to quickly isolate the potential duplicate values.
When d =5, m can have 4 values 50, 75, 100 and 125 cents. 50 and 75 will also be created with only 2 or 3 quarters. So I have found 2 duplicates, and 1 invalid amounts out of 10.

How should I move forward from here?

Thanks
 
  • Like
Likes Delta2
Physics news on Phys.org
  • #2
I would look at the quarters. Their sums either end in 0 or 5.
 
  • Like
Likes MatinSAR and musicgold
  • #3
If two combinations, ##d_1, q_1## and ##d_2, q_2## give the same ##m##, then
##10d_1+25q_1=10d_2+25q_2##
##10(d_1-d_2)=25(q_2-q_1)##.
I'd look at how many different solutions this equation has. ##q_2-q_1## has to be ##2##, etc.
 
  • Like
Likes musicgold
  • #4
Hill said:
If two combinations, ##d_1, q_1## and ##d_2, q_2## give the same ##m##, then
##10d_1+25q_1=10d_2+25q_2##
##10(d_1-d_2)=25(q_2-q_1)##.
I'd look at how many different solutions this equation has. ##q_2-q_1## has to be ##2##, etc.
Got it. Thanks! 👍
As shown below there are 8 duplicates.
I also realized that there are actually 27 unique values of m and not 26.

27 unique values + 8 duplicates + 1 invalid = 36 combinations
1705631959839.png
 
  • Like
Likes Hill
  • #5
I think you left out the combination of no coins = zero cents so there are 28 unique and 8 dupes. Zero is a legitimate amount of money (I know 'cause my bank balance went there a couple of times in my younger days :smile:
 
  • #6
phinds said:
I think you left out the combination of no coins = zero cents so there are 28 unique and 8 dupes. Zero is a legitimate amount of money (I know 'cause my bank balance went there a couple of times in my younger days :smile:
The homework statement says “using one or more of the 11 coins”.
 
  • #7
Two quarters are the same as 5 dimes. So points [itex](d,q)[/itex] which differ by integer multiples of [itex](5, -2)[/itex] give the same [itex]m[/itex].
 
  • #8
Frabjous said:
The homework statement says “using one or more of the 11 coins”.
Ah HA ! I need to learn how to read. :smile:
 
  • Like
Likes Frabjous

FAQ: Coin problem - all possible amounts from a set of coins

What is the Coin Problem?

The Coin Problem, also known as the Frobenius Coin Problem, is a mathematical problem that seeks to determine the largest monetary amount that cannot be obtained using any combination of coins of specified denominations. It also involves finding all possible amounts that can be formed using these coins.

How do you solve the Coin Problem for two coin denominations?

For two coin denominations, say a and b, where a and b are coprime (i.e., their greatest common divisor is 1), the largest amount that cannot be obtained is given by the formula (a * b) - a - b. All amounts greater than this can be formed using the two denominations.

What is the general approach to solve the Coin Problem for more than two denominations?

For more than two coin denominations, the problem becomes more complex. There isn't a simple formula like in the two-coin case. Instead, dynamic programming or the use of the Chicken McNugget theorem for specific cases can be employed. These methods involve constructing a table to keep track of all possible sums that can be formed and iteratively updating it based on the available coin denominations.

Can the Coin Problem be solved for any set of coin denominations?

Yes, the Coin Problem can be solved for any set of coin denominations, but the complexity and computational effort required can vary significantly. For large sets of denominations or high values, the problem can become computationally intensive. Algorithms like dynamic programming are typically used to handle such cases efficiently.

What are some practical applications of the Coin Problem?

The Coin Problem has several practical applications, particularly in areas involving resource allocation and optimization. Examples include making change in automated vending machines, optimizing the distribution of limited resources, and solving problems in combinatorial optimization and number theory.

Similar threads

Back
Top