Some experimental results on the Frobenius problem
Abstract
We study the Frobenius problem: given relatively prime positive integers a1,...,ad, find the largest value of t (the Frobenius number) such that Σk=1d mk ak = t has no solution in nonnegative integers m1,...,md. Based on empirical data, we conjecture that except for some special cases the Frobenius number can be bounded from above by a1 a2 a35/4 - a1 - a2 - a3.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.