On the Largest Prime Divisors of an Integer

Jean-Marie De Koninck
Additional contact information
Jean-Marie De Koninck: Université Laval, Départment de mathématiques et de statistique

A chapter in Extreme Value Theory and Applications, 1994, pp 447-462 from Springer

Abstract: 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.

Date: 1994
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-3638-9_27

Ordering information: This item can be ordered from
http://www.springer.com/9781461336389

DOI: 10.1007/978-1-4613-3638-9_27

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().