pith. sign in

arxiv: 1406.5213 · v5 · pith:XHYEQ6SGnew · submitted 2014-06-19 · 🧮 math.HO · math.CO

How many ways can you make change: Some easy proofs

classification 🧮 math.HO math.CO
keywords coinchangedenominationsderivedifferentformulasgivenknown
0
0 comments X
read the original abstract

Given a dollar, how many ways are there to make change using pennies, nickels, dimes, and quarters? What if you are given a different amount of money? What if you use different coin denominations? This is a well known problem and formulas are known. We present simpler proofs in several cases. We use recurrences to derive formulas if the coin denominations are {1,x,kx,rx}, and we use a simple proof using generating functions to derive a formula for any coin set.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.