The sub-four-thirds exponent conjecture for Frobenius numbers
The sub-four-thirds exponent conjecture for Frobenius numbers
Let be an admissible triplet, meaning a triplet of positive integers satisfying the admissibility conditions for the three-variable Frobenius problem, and let denote its Frobenius number. Sub-four-thirds exponent conjecture. There exists an upper bound for proportional to
where , valid for all admissible triplets . This conjecture seeks an upper bound of smaller magnitude than the known bounds, which are comparable to one proportional to ; the empirical evidence in the paper suggests the stronger exponent may work, but the general assertion remains unproved.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Matthias Beck, David Einstein and Shelemyahu Zacks, “Some experimental results on the Frobenius problem”, arXiv:math/0204036 (2005).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.