The coin problem (Frobenius problem) is a mathematical problem that asks what is the largest monetary amount that cannot be obtained using only coins of specified denominations.
The coin problem (Frobenius problem) is a mathematical problem that asks what is the largest monetary amount that cannot be obtained using only coins of specified denominations.
Algorithm definition: D. Beihoffer, J. Hendry, A. Nijenhuis, and S. Wagon (2005). "Faster algorithms for Frobenius numbers". Electronic Journal of Combinatorics 12: R27.
The coin problem (Frobenius problem) is a mathematical problem that asks what is the largest monetary amount that cannot be obtained using only coins of specified denominations.
MIT License