You are not currently logged in.

Access JSTOR through your library or other institution:


Log in through your institution.

Journal Article

A Variation on the Money-Changing Problem

Lance Bryant, James Hamblin and Lenny Jones
The American Mathematical Monthly
Vol. 119, No. 5 (May 2012), pp. 406-414
DOI: 10.4169/amer.math.monthly.119.05.406
Stable URL:
Page Count: 9
Were these topics helpful?
See somethings inaccurate? Let us know!

Select the topics that are inaccurate.

  • Download ($19.00)
  • Subscribe ($19.50)
  • Add to My Lists
  • Cite this Item
A Variation on the Money-Changing Problem
Preview not available


Abstract The classical money-changing problem is to determine what amounts of money can be made with a given set of denominations. We present a variation on this problem and ask the following question: For what denominations of money a1, a2, …, at is there exactly one way, using the fewest number of coins possible, to make change for every amount that can be made? We provide a solution to this problem when we have at most three denominations.

Page Thumbnails