Abstract
Suppose thatg(n) is equal to the number of divisors ofn, counting multiplicity, or the number of divisors ofn, a≠0 is an integer, andN(x,b)=|{n∶n≤x, g(n+a)−g(n)=b orb+1}|. In the paper we prove that sup b N(x,b)≤C(a)x)(log log 10 x )−1/2 and that there exists a constantC(a,μ)>0 such that, given an integerb |b|≤μ(log logx)1/2,x≥x o, the inequalityN(x,b)≥C(a,μ)x(log logx(−1/2) is valid.
Similar content being viewed by others
References
D. R. Heath-Brown, “The divisor function at consecutive integers,”Mathematika,31, 141–149 (1984).
I. Kan, “On the number-theoretic functionsv(n) and Ω(n),”Acta Arith.,78, No. 1, 91–97 (1996).
P. Erdös, C. Pomerance, and A. Sárközy, “On locally repeated values of certain arithmetic function. II,”Acta Math. Hungar.,49, 251–259 (1987).
N. M. Timofeev, “Estimates of the sums of multiplicative functions with shifted arguments,”Mat. Zametki [Math. Notes],54, No. 5, 84–98 (1993).
H. Halberstam and H. E. Richert,Sieve Methods, Acad. Press, London-New York (1974).
N. M. Timofeev, “The Hardy-Ramanujan and Kholos inequalities for shifted primes,”Mat. Zametki [Math. Notes],57, No. 5, 747–764 (1995).
R. Hall and G. Tenenbaum,Divisors, Cambridge Univ. Press, Cambridge-New York (1990).
I. P. Kubilus,Probabilistic Methods in Number Theory [in Russian], GIPNL, Vilnus (1962).
N. M. Timofeev and M. B. Khripunova, “The distribution of numbers with a given number of prime divisors in progressions,”Mat. Zametki [Math. Notes],55, No. 2, 144–156 (1994).
A. Selberg, “Note on a paper by L. G. Sathe,”J. Indian Math. Soc.,18, 83–87 (1954).
Author information
Authors and Affiliations
Additional information
Translated fromMatematicheskie Zametki, Vol. 66, No. 4, pp. 579–595, October, 1999.
Rights and permissions
About this article
Cite this article
Timofeev, N.M. On the difference between the number of prime divisors at consecutive integers. Math Notes 66, 474–488 (1999). https://doi.org/10.1007/BF02679098
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02679098