Continued fraction factorization
In number theory, the continued fraction factorization method (CFRAC) is an integer factorization algorithm. It is a general-purpose algorithm, meaning that it is suitable for factoring any integer n, not depending on special form or properties. It was described by D. H. Lehmer and R. E. Powers in 1931, and developed as a computer algorithm by Michael A. Morrison and John Brillhart in 1975.
- Lehmer, D.H.; Powers, R.E. (1931). "On Factoring Large Numbers". Bulletin of the American Mathematical Society. 37 (10): 770–776. doi:10.1090/S0002-9904-1931-05271-X.
- Morrison, Michael A.; Brillhart, John (January 1975). "A Method of Factoring and the Factorization of F7". Mathematics of Computation. American Mathematical Society. 29 (129): 183–205. JSTOR 2005475. doi:10.2307/2005475.
- Pomerance, Carl (December 1996). "A Tale of Two Sieves" (PDF). Notices of the AMS. 43 (12). pp. 1473–1485.
- Samuel S. Wagstaff, Jr. (2013). The Joy of Factoring. Providence, RI: American Mathematical Society. pp. 143–171. ISBN 978-1-4704-1048-3.
|This number theory-related article is a stub. You can help Wikipedia by expanding it.|