References
H. Delange. Sur la fonction sommatoire de la fonction “somme des chiffres.”Enseign. Math. 21 (1975), 31–47.
R. K. Guy.Unsolved Problems in Number Theory. Springer-Verlag, 2nd edition, 1994.
R. Kannan. Lattice translates of a polytope and the Frobenius problem.Combinatorics 12(1992), 161–177.
D. Kozen. and S. Zaks. Optimal bounds for the change-making problem.Theoret. Comput. Sci. 123 (1994), 377–388.
G. S. Lueker. Two NP-complete problems in nonnegative integer programming. Technical Report TR-178, Computer Science Laboratory, Department of Electrical Engineering, Princeton University, March 1975.
D. Pearson. A polynomial-time algorithm for the change-making problem. Technical Report TR 94–1433, Department of Computer Science, Cornell University, June 1994. Available from http://citeseer.nj.nec. com/pearson94polynomialtime. html.
R. A. Raimi. The first digit problem.Amer. Math. Monthly 83 (1976), 521–538.
J. L. Ramirez-Alfonsin. Complexity of the Frobenius problem.Combinatorica 16 (1996), 143–147.
J. Shallit. The computational complexity of the local postage stamp problem.SIGACT News 33(1) (2002), 90–94.
J. W. Wright. The change-making problem.J. Assoc. Comput. Mach. 22 (1975), 125–128.
Author information
Authors and Affiliations
Corresponding author
Additional information
“What this country needs is a really good five-cent cigar.” T. R. Marshall (US Vice-President),New York Tribune, January 4, 1920.
Rights and permissions
About this article
Cite this article
Shallit, J. What this country needs is an 18c piece. The Mathematical Intelligencer 25, 20–23 (2003). https://doi.org/10.1007/BF02984830
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02984830