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:
“That, upon the whole, we may conclude that the Christian religion not only was at first attended with miracles, but even at this day cannot be believed by any reasonable person without one. Mere reason is insufficient to convince us of its veracity: And whoever is moved by Faith to assent to it, is conscious of a continued miracle in his own person, which subverts all the principles of his understanding, and gives him a determination to believe what is most contrary to custom and experience.”
—David Hume (1711–1776)
“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)