Continued Fraction Factorization Algorithm
A Prime Factorization Algorithm which uses Residues produced in the Continued Fraction of 
for some suitably chosen 
to obtain a SquareNumber. The Algorithm solves
by finding an
for which 
(mod 
) has the smallest upper bound. The method requires (by conjecture) about
steps, and was the fastest Prime Factorization Algorithm in use before the Quadratic Sieve Factorization Method, which eliminates the 2 under the SquareRoot (Pomerance 1996), was developed.See also Exponent Vector, Prime Factorization Algorithms
References
Morrison, M. A. and Brillhart, J. ``A Method of Factoring and the Factorization of Pomerance, C. ``A Tale of Two Sieves.'' Not. Amer. Math. Soc. 43, 1473-1485, 1996.
.'' Math. Comput. 29, 183-205, 1975.
- Kampyle of Eudoxus
- KAM Theorem
- Kanizsa Triangle
- Kantorovich Inequality
- Kaplan-Yorke Conjecture
- Kaplan-Yorke Dimension
- Kaplan-Yorke Map
- Kappa Curve
- Kaprekar Number
- Kaprekar Routine
- Kaps-Rentrop Methods
- Kapteyn Series
- Karatsuba Multiplication
- k-ary Divisor
- Katona's Problem
- Kauffman Polynomial F
- Kauffman Polynomial X
- k-Chain
- k-Circuit
- k-Coloring
- Kei
- Keith Number
- Keller's Conjecture
- Kelvin Functions
- Kelvin's Conjecture