An Optimal Lower Bound for the Frobenius Problem
Iskander Aliev, Peter Gruber
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.
Create a lesson
Related papers
Value distribution of multiplicative functions along linear fractional sequences
Sun-Kai Leung
Delta theory of Anderson Modules II: Hodge-Pink structure
Sudip Pandit, Arnab Saha
Integers divisible by a shifted prime in a given interval
Rebecca Abi Abdallah, Valeriya Kovaleva, Jeremy Schlitt et al.
On Piatetski-Shapiro primes from almost primes
Yuhua Zhao, Jinjiang Li, Linji Long et al.
On Consecutive Non-primitive Elements over Finite Fields
Bidushi Sharma, Dhiren Kumar Basnet
Birch's theorem over function fields with quadratically many variables
Matthew Hase-Liu