An optimal lower bound for the Frobenius problem (Q868899): Difference between revisions

Let \(a_1,\ldots,a_N\) be coprime positive integers and denote by \(g_N=g_N(a_1,\ldots,a_N)\) the Frobenius number, that is the largest natural number that has no representation as a non-negative integer combination of \(a_1,\ldots,a_N\). Let \(f_N(a_1,\ldots,a_N)=g_N(a_1,\ldots,a_N)+\sum_{i=1}^Na_i\) the largest integer that is not a positive integer combination of \(a_1,\ldots,a_N\). Using tools from the geometry of numbers the authors give sharp lower bounds for the function \(f_N\). As a corollary among others they prove \[ f_N(a_1,\ldots,a_N)>((N-1)!\;a_1,\ldots,a_N)^{1/(N-1)} \] and for the case \(N=3\) that \[ f_3(a_1,a_2,a_3)\geq (3a_1a_2a_3)^{1/2}. \]