2000 character limit reached
Uniform lower bound for the least common multiple of a polynomial sequence
Published 29 Aug 2013 in math.NT | (1308.6458v2)
Abstract: Let $n$ be a positive integer and $f(x)$ be a polynomial with nonnegative integer coefficients. We prove that ${\rm lcm}_{\lceil n/2\rceil \le i\le n} {f(i)}\ge 2n$ except that $f(x)=x$ and $n=1, 2, 3, 4, 6$ and that $f(x)=xs$ with $s\ge 2$ being an integer and $n=1$, where $\lceil n/2\rceil$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.