6 research outputs found

    Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms

    Full text link
    Let ll and mm be two integers with l>m0l>m\ge 0, and let aa and bb be integers with a1a\ge 1 and a+b1a+b\ge 1. In this paper, we prove that loglcmmn<iln{ai+b}=An+o(n)\log {\rm lcm}_{mn<i\le ln}\{ai+b\} =An+o(n), where AA is a constant depending on l,ml, m and aa.Comment: 8 pages. To appear in Archiv der Mathemati
    corecore