Lehmer's Continued Fraction Factorization Algorithm

Quick intro LeetArxiv is Leetcode for implementing Arxiv papers . We help programmers transition into careers in computational research. You can also join our Reddit community here. Frontmatter for the 1931 paper ‘On Factoring Large Numbers’ by D.H. Lehmer and R.E. Powers *We provide a hand-written implementation that can be translated to different programming languages. 1.0 Introduction In 1931, at Stanford University, D.H Lehmer and R.E. Powers published a general integer factorization algorithm based on the theory of continued fractions. The algorithm remained relatively obscure until in 1975, when Brillhart and Morrison implemented it on a computer in honor of D.H Lehmer’s 70th birthday. Using Lehmer’s algorithm, Brillhart and Morrison(1975) factorized the seventh Fermat number : Seventh Fermat number factorized using Lehmer’s algorithm In this article, we shall code Lehmer’s continued fraction factorization method, and establish the algorithm’s implementation nuances. T ... Read full article.