Abstract
Imagine a country with coins of denominations 5 cents, 13 cents, and 27 cents. How many ways can you make change for $51,419.48? That is, how many solutions (b 1, b 2, b 3) are there to the equation \(5b_{1} + 13b_{2} + 27b_{3} = 5,\!141,\!948\), with the restriction that b 1, b 2, b 3 be nonnegative integers? This is a specific case of the following general problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Andrews, G.: The Theory of Partitions, reprint of the 1976 original. Cambridge University Press, Cambridge (1998)
Brauer, A.: On a problem of partitions. Am. J. Math. 64, 299–312 (1942)
Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)
Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proc. London Math. Soc. 17, 75–115 (1918)
Wilf, H.: Generating Functionology, 3rd edn. A K Peters, Ltd., Wellesley (2006)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Pinsky, R.G. (2014). Partitions with Restricted Summands or “the Money Changing Problem”. In: Problems from the Discrete to the Continuous. Universitext. Springer, Cham. https://doi.org/10.1007/978-3-319-07965-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-07965-3_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07964-6
Online ISBN: 978-3-319-07965-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)