Expected Frobenius numbers (Q618307)

Let \(a=(a_1,a_2,\dots,a_n)\in\mathbb{Z}_{>0}^n\) with \(\gcd(a_1,a_2,\dots,a_n)=1\). The Frobenius number of \(a\), denoted by \(F(a)\), is the largest number which cannot be represented as a nonnegative integral combination of \(a_1,a_2,\dots,a_n\). \textit{V. I. Arnol'd} [Arnold's problems. Translated and revised edition of the 2000 Russian original. Berlin: Springer (2004; Zbl 1051.00002)] conjectured that \[ F(a)\sim ((n-1)!a_1a_2\cdots a_n)^{1/(n-1)}. \] The main result of this paper shows that the ``average'' Frobenius number has an order of magnitude as predicted by the conjecture, that is, \[ \sup_T\frac{\sum_{a\in G(T)}\frac{F(a)}{(a_1a_2\cdots a_n)^{1/(n-1)}}}{|G(T)|}\ll_n1, \] where \[ G(T) =\{a\in\mathbb{Z}_{>0}^n\mid \gcd(a_1,a_2,\dots,a_n) = 1,\, |a|_\infty\leq T\}, \] and \(\ll_n\) denotes the Vinogradov symbol with the constant depending on \(n\) only.