Abstract
The art of factoring large integers was not very advanced before the days of the modern computer. Even if there existed some rather advanced algorithms for factorization, invented by some of the most outstanding mathematicians of all times, the amount of computational labor involved discouraged most people from applying those methods to sizable problems. So the field essentially belonged to a few enthusiasts, who however achieved quite impressive results, taking into account the modest means for calculations which they possessed. Famous among these results is F. N. Cole’s factorization in 1903 of 267 – 1 = 1 93707721 · 7618 38257287.
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.
Bibliography
R. Sherman Lehman, “Factoring Large Integers,” Math. Comp. 28 (1974) pp. 637–646.
Henri Cohen, A Course in Computational Algebraic Number Theory, Springer-Verlag, New York, 1993.
C. F. Gauss, Disquisitiones Arithmeticae, Yale University Press, New Haven, 1966, Art. 329–332.
L. G. Sathe, “On a Problem of Hardy on the Distribution of Integers Having a Given Numbers of Prime Factors, I”, Journ. Indian Math. Soc. 17 (1953) pp. 62–82.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Fifth edition, Oxford, 1979, pp. 354–359, 368–370.
Wladyslaw Narkiewicz, Number Theory, World Scientific, Singapore, 1983, pp. 251–259.
Mark Kac, Statistical Independence in Probability, Analysis and Number Theory, Carus Math. Monogr. no. 12, John Wiley and Sons, 1959, pp. 74–79.
Donald E. Knuth and Luis Trabb-Pardo, “Analysis of a Simple Factorization Algorithm” Theoretical Computer Sc. 3 (1976) pp. 321–348.
Karl Dickman, “On the Frequency of Numbers Containing Prime Factors of a Certain Relative Magnitude” Ark. Mat. Astr. Fys. 22A #10 (1930) pp. 1–14.
E.R. Canfield, Paul Erdõs and Carl Pomerance, “On a Problem of Oppenheim concerning “Factorisatio Numerorum,” Journ. Number Th. 17 (1983) pp. 1–28.
J. P. Buhler, H. W. Lenstra, and C. Pomerance, “Factoring Integers with the Number Field Sieve,” in A. K. Lenstra and H. W. Lenstra, Jr. (eds.), The Development of the Number Field Sieve, Lecture Notes in Mathematics 1554, Springer-Verlag, New York, 1993, pp. 50–94.
John Brillhart and John L. Selfridge, “Some Factorizations of 2n ± 1 and related results,” Math. Comp. 21 (1967) pp. 87–96.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Riesel, H. (1994). Classical Methods of Factorization. In: Prime Numbers and Computer Methods for Factorization. Progress in Mathematics, vol 126. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0251-6_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0251-6_5
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6681-5
Online ISBN: 978-1-4612-0251-6
eBook Packages: Springer Book Archive