Papers
Topics
Authors
Recent
Search
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$.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.