Abstract
We study the Frobenius problem: Given relatively prime positive integers a 1, …, a d , find the largest value of t (the Frobenius number) such that Σ k = 1 d m k a k = t has no solution in nonnegative integers m 1, …, m d . Based on empirical data, we conjecture that except for some special cases, the Frobenius number can be bounded from above by .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
