Hostname: page-component-5447f9dfdb-lxcff Total loading time: 0 Render date: 2025-07-28T17:51:54.844Z Has data issue: false hasContentIssue false
  • English
  • Français

On the divisor function d(n)

Part of: Probabilistic theory: distribution modulo $1$; metric theory of algorithms

Published online by Cambridge University Press:  26 February 2010

Jiahai Kan  and
Zun Shan
Jiahai Kan
Affiliation:
Nanjing Institute of Posts and Telecommunications, 210003 Nanjing, Nanjing, China.
Zun Shan
Affiliation:
Department of MathematicsNanjing Normal University, 210097 Nanjing, Nanjing, China.
Get access

Extract

In 1984 Heath-Brown [5] proved the following conjecture of Erdős and Mirsky [2] (which seemed at one time as hard as the twin prime problem):

“There exist infinitely many integers n for which d(n) = d(n + 1).”

MSC classification

Secondary: 11K65: Arithmetic functions

Information

Type
Research Article
Information
Mathematika , Volume 43 , Issue 2 , December 1996 , pp. 320 - 322
Copyright
Copyright © University College London 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1.Chen, J.. On the representation of a large even integer as the sum of a prime and the product of at most two primes. Sai. Sinica, 16 (1973). 157–176.Google Scholar
2.Erdos, P. and Mirsky, L.. The distribution of the values of the divisor function d(n). Proc. LMS (3), 2 (1952), 257–271.Google Scholar
3.Erdös, P., Pomerance, C. and Sárközy, A.. On locally repeated values of certain arithmetic functions. II. Acta Math. Hung., 49 (1987), 251–259.CrossRefGoogle Scholar
4.Halberstam, H. and Richert, H.-E.. Sieve Methods (Academic Press, London, 1974).Google Scholar
5.Heath-Brown, D. R.. The divisor function at consecutive integers. Mathematika, 31 (1984), 141–149.Google Scholar
6.Hildebrand, A.. The divisor function at consecutive integers. Pacif. J. Math. 129 (1987), 307–319.CrossRefGoogle Scholar
7.Kan, J.. On the lower bound sieve. Malhematika, 37 (1990), 273–286.CrossRefGoogle Scholar
8. J. Kan. On the number of solutions of N − p = P r. J. reine und angew. Math., 414 (1991), 117–130.Google Scholar