Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
|
   
Available in electronic format
Available in print format
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(e) ISSN 0002-9939(p)

     

Improvements of lower bounds for the least common multiple of finite arithmetic progressions

Author(s): Shaofang Hong; Yujuan Yang
Journal: Proc. Amer. Math. Soc. 136 (2008), 4111-4114.
MSC (2000): Primary 11A05
Posted: July 17, 2008
MathSciNet review: 2431021
Retrieve article in: PDF

Abstract | References | Similar articles | Additional information

Abstract: Let $ u_0, r, \alpha $ and $ n$ be positive integers such that $ (u_ 0,r)=1$. Let $ u_k=u_0+kr$ for $ 1\leq k\leq n$. We prove that $ L_n :={\rm lcm}\{u_0, u_1,\cdots, u_n\}\geq u_ 0r^\alpha (r+1)^n$ if $ n>r^\alpha $. This improves the lower bound of $ L_n$ obtained previously by Farhi, Hong and Feng.


References:

1.
T. M. Apostol, Introduction to analytic number theory, Springer-Verlag, New York, 1976. MR 0434929 (55:7892)

2.
G. Bachman and T. Kessler, On divisibility properties of certain multinomial coefficients. II, J. Number Theory 106 (2004), 1-12. MR 2029778 (2005a:11019)

3.
B. Farhi, Minorations non triviales du plus petit commun multiple de certaines suites finies d'entiers, C.R. Acad. Sci. Paris, Ser. I 341 (2005), 469-474. MR 2180812 (2006g:11006)

4.
B. Farhi, Nontrivial lower bounds for the least common multiple of some finite sequences of integers, J. Number Theory 125 (2007), 393-411. MR 2332595

5.
B. Green and T. Tao, The primes contain arbitrarily long arithmetic progressions, Ann. of Math. (2) 167 (2008), 481-548.

6.
D. Hanson, On the product of the primes, Canad. Math. Bull. 15 (1972), 33-37. MR 0313179 (47:1734)

7.
G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, fourth edition, Oxford University Press, London, 1960. MR 0067125 (16:673c)

8.
S. Hong and W. Feng, Lower bounds for the least common multiple of finite arithmetic progressions, C.R. Acad. Sci. Paris, Ser. I 343 (2006), 695-698. MR 2284695 (2007h:11004)

9.
S. Hong and R. Loewy, Asymptotic behavior of eigenvalues of greatest common divisor matrices, Glasgow Math. J. 46 (2004), 551-569. MR 2094810 (2005f:11040)

10.
K. Ireland and M. Rosen, A classical introduction to modern number theory, 2nd edition, GTM 84, Springer-Verlag, New York, 1990. MR 1070716 (92e:11001)

11.
G. Myerson and J. Sander, What the least common multiple divides. II, J. Number Theory 61 (1996), 67-84. MR 1418320 (97k:11003)

12.
M. Nair, On Chebyshev-type inequalities for primes, Amer. Math. Monthly 89 (1982), 126-129. MR 643279 (83f:10043)

Similar Articles:

Retrieve articles in Proceedings of the American Mathematical Society with MSC (2000): 11A05

Retrieve articles in all Journals with MSC (2000): 11A05


Additional Information:

Shaofang Hong
Affiliation: Mathematical College, Sichuan University, Chengdu 610064, People’s Republic of China
Email: s-f.hong@tom.com, hongsf02@yahoo.com, sfhong@scu.edu.cn

Yujuan Yang
Affiliation: Mathematical College, Sichuan University, Chengdu 610064, People’s Republic of China
Email: y.j.yang@tom.com

DOI: 10.1090/S0002-9939-08-09565-8
PII: S 0002-9939(08)09565-8
Keywords: Arithmetic progression, least common multiple, lower bound.
Received by editor(s): September 18, 2007
Posted: July 17, 2008
Additional Notes: The first author was supported in part by the Program for New Century Excellent Talents in University, Grant No. NCET-06-0785.
Communicated by: Wen-Ching Winnie Li
Copyright of article: Copyright 2008, American Mathematical Society
The copyright for this article reverts to public domain after 28 years from publication.




AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia