Get the latest tech news
Lehmer's Continued Fraction Factorization Algorithm
Step-by-Step hand-written guide to Lehmer's Algorithm Based on the Original 1931 Paper : On Factoring Large Numbers
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. In this article, we shall code Lehmer’s continued fraction factorization method, and establish the algorithm’s implementation nuances. We provide an example of Lehmer’s approach to finding the continued fraction expansion of N. We use the algorithm shown in the image of Section 2.2
Or read this on Hacker News