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:
““Contrariwise,” continued Tweedledee, “if it was so, it might be; and if it were so, it would be; but as it isn’t, it ain’t. That’s logic.””
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)
“The visual is sorely undervalued in modern scholarship. Art history has attained only a fraction of the conceptual sophistication of literary criticism.... Drunk with self-love, criticism has hugely overestimated the centrality of language to western culture. It has failed to see the electrifying sign language of images.”
—Camille Paglia (b. 1947)