2000 character limit reached
Asymptotic behavior of the least common multiple of consecutive reducible quadratic progression terms
Published 24 Jun 2014 in math.NT | (1406.6123v1)
Abstract: Let $l$ and $m$ be two integers with $l>m\ge 0$, and let $f(x)$ be the product of two linear polynomials with integer coefficients. In this paper, we show that $\log {\rm lcm}_{mn<i\le ln}{f(i)}=An+o(n)$, where $A$ is a constant depending only on $l$, $m$ and $f$.
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.