New lower bounds for the least common multiples of arithmetic progressions
Rongjun Wu , Qianrong Tan , Shaofang Hong
Chinese Annals of Mathematics, Series B ›› 2013, Vol. 34 ›› Issue (6) : 861 -864.
New lower bounds for the least common multiples of arithmetic progressions
For relatively prime positive integers u 0 and r, and for 0 ≤ k ≤ n, define u k:= u 0 + kr. Let L n:= lcm(u 0, u 1, ..., u n) and let a, l ≥ 2 be any integers. In this paper, the authors show that, for integers α ≥ a, r ≥ max(a,l − 1) and n ≥ lαr, the following inequality holds $L_n \geqslant u_0 r^{\left( {l - 1} \right)\alpha + a - l} \left( {r + 1} \right)^n .$ Particularly, letting l = 3 yields an improvement on the best previous lower bound on L n obtained by Hong and Kominers in 2010.
Arithmetic progression / Least common multiple / Lower bound
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
/
| 〈 |
|
〉 |