Hostname: page-component-8448b6f56d-wq2xx Total loading time: 0 Render date: 2024-04-23T16:06:27.604Z Has data issue: false hasContentIssue false

THE LEAST COMMON MULTIPLE OF CONSECUTIVE TERMS IN A QUADRATIC PROGRESSION

Published online by Cambridge University Press:  12 April 2012

GUOYOU QIAN
Affiliation:
Mathematical College, Sichuan University, Chengdu 610064, PR China (email: qiangy1230@gmail.com, qiangy1230@163.com)
QIANRONG TAN
Affiliation:
School of Computer Science and Technology, Panzhihua University, Panzhihua 617000, PR China (email: tqrmei6@126.com)
SHAOFANG HONG*
Affiliation:
Yangtze Center of Mathematics, Sichuan University, Chengdu 610064, PR China (email: sfhong@scu.edu.cn, s-f.hong@tom.com, hongsf02@yahoo.com)
*
For correspondence; e-mail: sfhong@scu.edu.cn
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let k be any given positive integer. We define the arithmetic function gk for any positive integer n by We first show that gk is periodic. Subsequently, we provide a detailed local analysis of the periodic function gk, and determine its smallest period. We also obtain an asymptotic formula for log lcm0≤ik {(n+i)2+1}.

Type
Research Article
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2012

Footnotes

S. Hong was supported partially by National Science Foundation of China Grant #10971145 and by the PhD Programs Foundation of Ministry of Education of China Grant #20100181110073.

References

[1]Bateman, P., Kalb, J. and Stenger, A., ‘A limit involving least common multiples’, Amer. Math. Monthly 109 (2002), 393394.Google Scholar
[2]Bennett, M. A., Bruin, N., Györy, K. and Hajdu, L., ‘Powers from products of consecutive terms in arithmetic progression’, Proc. Lond. Math. Soc. 92 (2006), 273306.CrossRefGoogle Scholar
[3]Chebyshev, P. L., ‘Memoire sur les nombres premiers’, J. Math. Pures Appl. 17 (1852), 366390.Google Scholar
[4]Farhi, B., ‘Nontrivial lower bounds for the least common multiple of some finite sequences of integers’, J. Number Theory 125 (2007), 393411.CrossRefGoogle Scholar
[5]Farhi, B. and Kane, D., ‘New results on the least common multiple of consecutive integers’, Proc. Amer. Math. Soc. 137 (2009), 19331939.CrossRefGoogle Scholar
[6]Green, B. and Tao, T., ‘The primes contain arbitrarily long arithmetic progressions’, Ann. of Math. (2) 167 (2008), 481547.CrossRefGoogle Scholar
[7]Hanson, D., ‘On the product of the primes’, Canad. Math. Bull. 15 (1972), 3337.CrossRefGoogle Scholar
[8]Hardy, G. H. and Littlewood, J. E., ‘Some problems of partitio numerorum III: On the expression of a number as a sum of primes’, Acta Math. 44 (1923), 170.CrossRefGoogle Scholar
[9]Hong, S. and Qian, G., ‘The least common multiple of consecutive arithmetic progression terms’, Proc. Edinb. Math. Soc. 54 (2011), 431441.CrossRefGoogle Scholar
[10]Hong, S., Qian, G. and Tan, Q., ‘The least common multiple of a sequence of products of linear polynomials’, Acta Math. Hungar., 135 (2012), 160167.CrossRefGoogle Scholar
[11]Hong, S. and Yang, Y., ‘On the periodicity of an arithmetical function’, C.R. Acad. Sci. Paris Ser. I 346 (2008), 717721.CrossRefGoogle Scholar
[12]Hua, L.-K., Introduction to Number Theory (Springer, Berlin, 1982).Google Scholar
[13]Iwaniec, H., ‘Almost-primes represented by quadratic polynomials’, Invent. Math. 47 (1978), 171188.Google Scholar
[14]Nair, M., ‘On Chebyshev-type inequalities for primes’, Amer. Math. Monthly 89 (1982), 126129.CrossRefGoogle Scholar
[15]Saradha, N. and Shorey, T. N., ‘Almost squares in arithmetic progression’, Compositio Math. 138 (2003), 73111.CrossRefGoogle Scholar