Uniform lower bound for the least common multiple of a polynomial sequence
Abstract
Let n be a positive integer and f(x) be a polynomial with nonnegative integer coefficients. We prove that lcm n/2 i n \f(i)\ 2n except that f(x)=x and n=1, 2, 3, 4, 6 and that f(x)=xs with s 2 being an integer and n=1, where n/2 denotes the smallest integer which is not less than n/2. This improves and extends the lower bounds obtained by Nair in 1982, Farhi in 2007 and Oon in 2013.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.