Let gj denote the largest integer that is represented exactly j times as a non-negative integer linear combination of {x1, . . . , xn}. We show that for any k > 0, and n = 5, the quantity g0 ?gk is unbounded. Furthermore, we provide examples with g0 > gk for n ≥ 6 and g0 > g1 for n ≥ 4.
展开▼
