An Optimal Lower Bound for the Frobenius Problem
Abstract
Given N positive integers a1, ..., aN with (a1, ..., aN)=1, let fN denote the largest natural number which is not a positive integer combination of a1, ..., aN. This paper gives an optimal lower bound for fN in terms of the absolute inhomogeneous minimum of the standard (N-1)-simplex.
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.