首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms
Authors:Guoyou Qian  Shaofang Hong
Institution:1. Center for Combinatorics, Nankai University, Tianjin, 300071, People’s Republic of China
2. Yangtze Center of Mathematics, Sichuan University, Chengdu, 610064, People’s Republic of China
3. Mathematical College, Sichuan University, Chengdu, 610064, People’s Republic of China
Abstract:Let l and m be two integers with l > m ≥ 0, and let a and b be integers with a ≥ 1 and a + b ≥ 1. In this paper, we prove that log lcm mn < i ≤ ln {ai + b} = An + o(n), where A is a constant depending on l, m and a.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号