Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius (Q909697): Difference between revisions

Let \(x_ 1<x_ 2<...<x_ b\) be integers with \(g.c.d.(x_ 1,...,x_ b)=1\), \(G(x_ 1,...,x_ b)\) the Frobenius number of this system of integers and \(g(b,a)=\sup G(x_ 1,...,x_ b)\) where the upper bound is taken over all such systems with \(x_ b=a\). It is proved that g(b,a) is roughly equal to \(a^ 2/(b-1)\) and the exact value of g(b,a) is given if \(b-1\) divides a or \(a-1\) or \(a-2.\)