Abstract
The shopkeeper’s problem – giving change to a customer who offers an amount of money for a particular purchase – leads to a very sophisticated mathematical idea. Given one positive integer (the difference between the amount offered and the cost of the item) how many ways are there to write this (give change) as a sum of other positive integers?
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Camina, A., Lewis, B. (2011). Partitions and Paths. In: An Introduction to Enumeration. Springer Undergraduate Mathematics Series. Springer, London. https://doi.org/10.1007/978-0-85729-600-9_9
Download citation
DOI: https://doi.org/10.1007/978-0-85729-600-9_9
Publisher Name: Springer, London
Print ISBN: 978-0-85729-599-6
Online ISBN: 978-0-85729-600-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)