Unbounded Discrepancy in Frobenius Numbers

Abstract Let gj denote the largest integer that is represented exactly j times as a non-negative integer linear combination of {x 1, . . . , xn }. We show that for any k > 0, and n = 5, the quantity g 0 – gk is unbounded. Furthermore, we provide examples with g 0 > gk for n ≥ 6 and g 0 > g 1 for n ≥ 4.