WorksMathematics
A Sharp Upper Bound for the Frobenius Number
Abstract
Let be integers with and . Their Frobenius number is the largest integer that cannot be expressed as a nonnegative integer combination of . Erdős and Graham proved the classical bound , which depends on the two largest generators. Dixmier subsequently proved their conjecture , a bound depending only on and that removes the factor from the corresponding quadratic estimate. Following the Erdős–Graham approach, we remove the factor while retaining the dependence on , and prove . This bound can be substantially smaller than Dixmier's when is small relative to . For every , we also construct infinitely many instances satisfying the reverse inequality, which shows that the bound is sharp.