Skip to main content Accessibility help
×
Home

Asymptotic Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions

  • Daniel M. Kane (a1) and Scott Duke Kominers (a2)

Abstract

For relatively prime positive integers ${{u}_{0}}$ and $r$ , we consider the least common multiple ${{L}_{n}}\,:=\,\text{lcm}\left( {{u}_{0}},\,{{u}_{1}},\,.\,.\,.\,,\,{{u}_{n}} \right)$ of the finite arithmetic progression $\left\{ {{u}_{k}}\,:=\,{{u}_{0}}\,+\,kr \right\}_{k=0}^{n}$ . We derive new lower bounds on ${{L}_{n}}$ that improve upon those obtained previously when either ${{u}_{0}}$ or $n$ is large. When $r$ is prime, our best bound is sharp up to a factor of $n\,+\,1$ for ${{u}_{0}}$ properly chosen, and is also nearly sharp as $n\,\to \,\infty$ .

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Asymptotic Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Asymptotic Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Asymptotic Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions
      Available formats
      ×

Copyright

References

Hide All
[BKS02] Bateman, P., Kalb, J., and Stenger, A., A limit involving least common multiples: 10797. Amer. Math. Monthly 109 (2002), no. 4, 393394. http://dx.doi.org/10.2307/2695513
[Far05] Farhi, B., Minorations non triviales du plus petit commun multiple de certaines suites finies d’entiers. C. R. Math. Acad. Sci. Paris 341 (2005), no. 8, 469474. http://dx.doi.org/10.1016/j.crma.2005.09.019
[Far07] Farhi, B., Nontrivial lower bounds for the least common multiple of some finite sequences of integers. J. Number Theory 125 (2007), no. 2, 393411. http://dx.doi.org/10.1016/j.jnt.2006.10.017
[FK09] Farhi, B. and Kane, D., New results on the least common multiple of consecutive integers. Proc. Amer. Math. Soc. 137 (2009), no. 6, 19331939. http://dx.doi.org/10.1090/S0002-9939-08-09730-X
[Han72] Hanson, D., On the product of the primes. Canad. Math. Bull. 15 (1972), 3337. http://dx.doi.org/10.4153/CMB-1972-007-7
[HF06] Hong, S. and Feng, W., Lower bounds for the least common multiple of finite arithmetic progressions. C. R. Acad. Sci. Paris 343 (2006), no. 1112, 695698. http://dx.doi.org/10.1016/j.crma.2006.11.002
[HK10] Hong, S. and Kominers, S. D., Further improvements of lower bounds for the least common multiples of arithmetic progressions. Proc. Amer. Math. Soc. 138 (2010), no. 3, 809813. http://dx.doi.org/10.1090/S0002-9939-09-10083-7
[HQ11] Hong, S. and Qian, G., The least common multiple of consecutive arithmetic progression terms. Proc. Edinb. Math. Soc. (2) 54 (2011), no. 2, 431441. http://dx.doi.org/10.1017/S0013091509000431
[HY08] Hong, S. and Yang, Y., Improvements of lower bounds for the least common multiple of finite arithmetic progressions. Proc. Amer. Math. Soc. 136 (2008), no. 12, 41114114. http://dx.doi.org/10.1090/S0002-9939-08-09565-8
[IK04] Iwaniec, H. and Kowalski, E., Analytic number theory. American Mathematical Society Colloquium Publications, 53, American Mathematical Society, Providence, RI, 2004.
[Nai82] Nair, M., On Chebyshev-type inequalities for primes. Amer. Math. Monthly 89 (1982), no. 2, 126129. http://dx.doi.org/10.2307/2320934
[WTH13] Wu, R., Tan, Q., and Hong, S., New lower bounds for the least common multiples of arithmetic progressions. Chin. Ann. Math. Ser. B 34 (2013), no. 6, 861864. http://dx.doi.org/10.1007/s11401-013-0805-9
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Keywords

Related content

Powered by UNSILO

Asymptotic Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions

  • Daniel M. Kane (a1) and Scott Duke Kominers (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.