Asymptotic behavior of the least common multiple of consecutive reducible quadratic progression terms
classification
🧮 math.NT
keywords
asymptoticbehaviorcoefficientscommonconsecutiveconstantdependinginteger
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.