Abstract
Here we consider only prime divisors of n and ask, for given order of magnitude of n, “how many prime divisors are there typically?” and “how many different ones are there?” Some of the answers will be rather counterintuitive. Thus, a 50-digit number (1021 times the age of our universe measured in picoseconds) has only about 5 different prime factors on average and even more surprisingly — 50-digit numbers have typically fewer than 6 prime factors in all, even counting repeated occurrences of the same prime factor as separate factors.
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
G.H. Hardy, E.M. Wright: An Introduction to the Theory of Numbers, 5th ed., Sect. 22.8 (Clarendon, Oxford 1984)
M. Abramowitz, I.A. Stegun (eds.): Handbook of Mathematical Functions (Dover, New York 1970)
J. Kubilius: Probabilistic Methods in the Theory of Numbers Translations of Mathematical Monographs 11 (Auger. Math. Soc, Providence 1964)
S.W. Graham: The greatest prime factor of the integers in an interval. J. London Math. Soc. (2) 24, 427–440 (1981)
C. Couvreur, J.J. Quisquater: An introduction to fast generation of large prime numbers. Philips J. Res. 37, 231–264 (1982)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schroeder, M.R. (1997). The Prime Divisor Functions. In: Number Theory in Science and Communication. Springer Series in Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03430-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-03430-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62006-8
Online ISBN: 978-3-662-03430-9
eBook Packages: Springer Book Archive