Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms
Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms
复制标题
DOI：
10.1007/s00013-013-0510-7
复制
发表时间：
2013-04
影响因子：
0.6
通讯作者：
Guoyou Qian;Shaofang Hong
中科院分区：
文献类型：
--
作者：
Guoyou Qian;Shaofang Hong
设m和m是两个l>m≥ 0的整数，且a ≥ 1和+B≥ 1的整数。本文证明了log lcmmn<i≤ln{ai+B} =An+o（n），其中A是依赖于l，manda的常数.
Letlandmbe two integers withl>m≥ 0, and letaandbbe integers witha≥ 1 anda+b≥ 1. In this paper, we prove that log lcmmn<i≤ln{ai+b} =An+o(n), whereAis a constant depending onl,manda.