We study variants of the Frobenius coin-exchange problem: Given n positive relatively prime parameters, what is the largest integer that cannot be represented as a nonnegative integral linear combination of the […]