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,[1] and developed as a computer algorithm by Michael A. Morrison and John Brillhart in 1975.[2]

The continued fraction method is based on Dixon's factorization method. It uses convergents in the regular continued fraction expansion of

.

Since this is a quadratic irrational, the continued fraction must be periodic (unless n is square, in which case the factorization is obvious).

It has a time complexity of , in the O and L notations.[3]

References

edit
  1. ^ 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.
  2. ^ Morrison, Michael A.; Brillhart, John (January 1975). "A Method of Factoring and the Factorization of F7". Mathematics of Computation. 29 (129). American Mathematical Society: 183–205. doi:10.2307/2005475. JSTOR 2005475.
  3. ^ Pomerance, Carl (December 1996). "A Tale of Two Sieves" (PDF). Notices of the AMS. Vol. 43, no. 12. pp. 1473–1485.

Further reading

edit


Stub icon

This number theory–related article is a stub. You can help Wikipedia by adding missing information.

📚 Artikel Terkait di Wikipedia

Periodic continued fraction

In mathematics, an infinite periodic continued fraction is a simple continued fraction that can be placed in the form x = a 0 + 1 a 1 + 1 a 2 + 1 ⋱ a

Integer factorization

factorization be solved in polynomial time on a classical computer? More unsolved problems in computer science In mathematics, integer factorization is

Factorization

example, 3 × 5 is an integer factorization of 15, and (x − 2)(x + 2) is a polynomial factorization of x2 − 4. Factorization is not usually considered meaningful

Solving quadratic equations with continued fractions

analytical theory of continued fractions. Here is a simple example to illustrate the solution of a quadratic equation using continued fractions. We begin with

Euclidean algorithm

curve factorization. The Euclidean algorithm may be used to find this GCD efficiently. Continued fraction factorization uses continued fractions, which

Shor's algorithm

circuits. In 2012, the factorization of 15 {\displaystyle 15} was performed with solid-state qubits. Later, in 2012, the factorization of 21 {\displaystyle

Wheel factorization

Wheel factorization is a method for generating a sequence of natural numbers by repeated additions, as determined by a number of the first few primes

List of number theory topics

Bonse's inequality Prime factor Table of prime factors Formula for primes Factorization RSA number Fundamental theorem of arithmetic Square-free Square-free