Frobenius coin-exchange generating functions (Matthias Beck, San Francisco State University)
Roberts North 102, CMCWe 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 given integers? This problem and its siblings can be understood through generating functions with 0/1 coefficients according to whether or not an integer is representable. […]