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:
“There is not any present moment that is unconnected with some future one. The life of every man is a continued chain of incidents, each link of which hangs upon the former. The transition from cause to effect, from event to event, is often carried on by secret steps, which our foresight cannot divine, and our sagacity is unable to trace. Evil may at some future period bring forth good; and good may bring forth evil, both equally unexpected.”
—Joseph Addison (1672–1719)
“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)