The Frobenius Coin Problem—A Cylindrical Approach
- 42 Downloads
Let a and b be two relatively prime positive integers, both greater than 1. Frobenius asked which values we can obtain using coins of denominations a and b. Since the sequence \(0, b, 2b, \ldots, (a-1) \cdot b\)
The author thanks Theodore Ehrenborg for comments on an earlier draft of this note. The author also thanks the Institute for Advanced Study for hosting a research visit in summer 2019, where this work was completed. This work was partially supported by a grant from the Simons Foundation (#429370 to Richard Ehrenborg).