arXiv · 1204.5415
Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms
Abstract
Let $l$ and $m$ be two integers with $l>m\ge 0$, and let $a$ and $b$ be integers with $a\ge 1$ and $a+b\ge 1$. In this paper, we prove that $\log {\rm lcm}_{mn<i\le ln}\{ai+b\} =An+o(n)$, where $A$ is a constant depending on $l, m$ and $a$.
Explore related subjects
Keep this discovery
Guoyou Qian, Shaofang Hong. 2012-04-24. Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms. https://doi.org/10.1007/s00013-013-0510-7
Cite the original work for its findings. Save a collection to share your selection of sources.