The sub-four-thirds exponent conjecture for Frobenius numbers
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.