Abstract
Several results of number theory can be expressed in probabilistic terms and, for others, the simplest proof is by probabilistic methods. Simply take the uniform distribution on the consecutive integers 1, 2,…, N. Then arithmetic functions, when restricted to the integers 1 through N, become random variables and arithmetic means are expectations. The power of probabilistic methods lies in the fact that divisibility by distinct primes are almost independent events. On the other hand, most problems remain challenging since the errors generated by the not exact independence can be dominating in a problem when one faces an increasing number of primes. The best example is the study of large prime divisors where the results do not resemble those which one would get for independent random variables.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Alladi and P. Erdös, On an additive arithmetic function, Pacific J. Math. 71 (1977), 275–294.
K. Alladi and P. Erdos, On the asymptotic behaviour of large prime factors of an integer, Pacific J. Math. 82 (1979), 295–315.
J.M. De Koninck, Sur les plus grands facteurs premiers d’un entier, Monatshefte Math. 116, 13–37 (1993).
J.M. De Koninck and J. Galambos, The intermediate prime divisors of an integer, Proc. Amer. Math. Soc. 101 (1987), 213–216.
J.M. De Koninck and A. Ivic, The distribution of the average prime divisor of an integer, Archiv der Math. 43 (1984), 37–43.
J.M. De Koninck and A. Ivic, Arithmetic functions defined on sets of primes of positive density, (to appear).
P. Erdos and A. Ivic, On sums involving reciprocals of certain arithmetical functions, Publ. Inst. Math. Belgrade 32 (1982), 49–56.
P. Erdos, A. Ivic and C. Pomerance, On sums involving reciprocals of the largest prime factor of an integer, Glasnik Matematicki 21 (1986), 27–44.
J. Galambos, The sequences of prime divisors of an integer, Acta Arith. 31 (1976), 213–218.
D.A. Goldston and K.S. McCurley, Sieving the positive integers by large primes, J. Number Theory 28 (1988), 94–115.
D.A. Goldston and K.S. McCurley, Sieving the positive integers by small primes, Trans. AMS 307 (1988), 51–62.
J.L. Hafner and K.S. McCurley, On the distribution of running times of certain integer factoring algorithms, IBM Research Report, 1987.
A. Hildebrand, On the number of positive integers ≤ x and free of prime factors > y, J. Number Theory 22 (1986), 289–307.
A. Ivic, On the k-th prime factor of an integer, Univ. u Novom Sadu Zb. Rad. Prirodno.-Mat. Fak. Ser. Mat. 20 (1990), 63–73.
A. Ivic, On large additive functions on primes of positive density, (to appear).
D.E. Knuth and L.T. Pardo, Analysis of a simple factorization algorithm, Theoretical Computer Science 3 (1976), 321–348.
H. Riesel, Prime Numbers and Computer Methods for Factorization, Birkhäuser, 1985.
G. Tenenbaum, Introduction à la théorie analytique et probabiliste des nombres, Institut Elie Cart an, 1990.
M.C. Wunderlich and J.L. Selfridge, A design for a number theory package with an optimized trial division routine, Communications of the ACM 17 (1974), 272–276.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Kluwer Academic Publishers
About this chapter
Cite this chapter
De Koninck, JM. (1994). On the Largest Prime Divisors of an Integer. In: Galambos, J., Lechner, J., Simiu, E. (eds) Extreme Value Theory and Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3638-9_27
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3638-9_27
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3640-2
Online ISBN: 978-1-4613-3638-9
eBook Packages: Springer Book Archive