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.
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.
Famous quotes containing the words continued and/or fraction:
“The protection of a ten-year-old girl from her father’s advances is a necessary condition of social order, but the protection of the father from temptation is a necessary condition of his continued social adjustment. The protections that are built up in the child against desire for the parent become the essential counterpart to the attitudes in the parent that protect the child.”
—Margaret Mead (1901–1978)
“The mother as a social servant instead of a home servant will not lack in true mother duty.... From her work, loved and honored though it is, she will return to her home life, the child life, with an eager, ceaseless pleasure, cleansed of all the fret and fraction and weariness that so mar it now.”
—Charlotte Perkins Gilman (1860–1935)