Evaluating the Sharpness and Limitations of Bounds on the Frobenius Number

Abstract

In this paper we study the (classical) Frobenius problem, namely the problem of finding the largest integer that cannot be represented as a nonnegative integral combination of given relatively prime (strictly) positive integers (known as the Frobenius number). We firstly compare several upper bounds on the Frobenius number, assessing their relative tightness through both theoretical arguments and Monte Carlo simulations. We then explore whether a general upper bound with a worst-case exponent strictly less than quadratic can exist, and formally demonstrate that such an improvement is impossible. These findings offer new insights into the structural properties of established bounds and underscore inherent constraints for future refinement.