Abstract
We study the pseudo-random properties of the inequalities P (n) < P (n+1) or P (n) > P (n+1) (where P (n) denotes the greatest prime factor of n) for both well-distribution and correlation.
Similar content being viewed by others
REFERENCES
J. Cassaigne, S. Ferenczi, C. Mauduit, J. Rivat, and A. SÁrkÖzy, On finite pseudorandom binary sequences III (The Liouville function I), Acta Arithmetica 87 (1999), 367–390.
J. Cassaigne, S. Ferenczi, C. Mauduit, J. Rivat, and A. SÁrkÖzy, On finite pseudorandom binary sequences IV (The Liouville function II), Acta Arithmetica (2000).
H. Daboussi and A. SÁrkÖzy, On pseudorandom properties of multiplicative functions, in preparation, (2000).
P. D. T. A. Elliott, Probabilistic Number Theory I, vol. 239 of Grundlehren der mathematischen Wissenschaften, Springer-Verlag, 1979.
P. ErdŐs and C. Pomerance, On the largest prime factor of n and n+1, Aequationes Mathematicae 17 (1978), pp. 311–321.
R. Graham, D. Knuth and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, second ed., 1994.
H. Halberstam and H.-R. Richert, Sieve Methods, Academic Press, New York-London, 1974.
C. Mauduit and A. SÁrkÖzy, On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol, Acta Arithmetica 82 (1997), 365–377.
C. Mauduit and A. SÁrkÖzy, On finite pseudorandom binary sequences II: The Champernowne, Rudin-Shapiro and Thue-Morse sequences. A further construction, Journal of Number Theory 73 (1998), 256–276.
J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois Journal of Mathematics 6 (1962), 64–94.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rivat, J. On pseudo-random properties of P (n) and P (n + 1). Periodica Mathematica Hungarica 43, 121–136 (2002). https://doi.org/10.1023/A:1015289816905
Issue Date:
DOI: https://doi.org/10.1023/A:1015289816905