On the problem related with a law of the iterated logarithm
https://doi.org/10.22405/2226-8383-2025-26-5-221-245
Abstract
In paper we consider the problem of finding the number of natural numbers that do not
exceed a given 𝑛, satisfying certain conditions for the function 𝜈(𝑚) – the number of prime
divisors of 𝑚. This work summarizes the result of M. V. Leveque, who considered the values
of the function 𝜈 at consecutive terms of the natural series. In contrast, the present article
examines the behavior of this function at consecutive points of an arithmetic progression. The
solution relies on coprimality and the resulting statistical independence of the prime divisors of neighboring terms in the arithmetic progression.
About the Author
Elina Viktorovna TishchenkoRussian Federation
postgraduate student
References
1. Lamperti, J. 1973, Probability, Nauka, Moscow.
2. Hardy, G.H. & Ramanujan, S. 1917, “The normal number of prime factors of a number 𝑛”, Quarterly Journal of Mathematics, vol. 48, pp. 76–92.
3. Erd˝os, P. & Kac, M. 1940, “The Gaussian law of errors in the theory of additive number theoretic functions”, American Journal of Mathematics, vol. 62, no. 1, pp. 738–742.
4. LeVeque, W.J. 1949, “On the size of certain number-theoretic functions”, Transactions of the American Mathematical Society, vol. 66, no. 2, pp. 440–463.
5. Cram´er, H. 1976, Mathematical methods of statistics, Mir, Moscow.
6. Erd˝os, P. & Wintner, A. 1939, “Additive arithmetical functions and statistical independence”, American Journal of Mathematics, vol. 61, no. 3, pp. 713–721.
7. Wu, J. 2004, “Chen’s double sieve, Goldbach’s conjecture and the twin prime problem”, Acta Arithmetica, vol. 114, no. 3, pp. 215–273.
8. Prachar, K. 1976, Distribution of prime numbers, Mir, Moscow.
Review
For citations:
Tishchenko E.V. On the problem related with a law of the iterated logarithm. Chebyshevskii Sbornik. 2025;26(5):221-245. (In Russ.) https://doi.org/10.22405/2226-8383-2025-26-5-221-245
JATS XML






















