LeetArxiv: Reimplementing a 1931 Integer Factorization Algorithm

LeetArxiv recreates a 1931 integer factorization algorithm by Lehmer and Powers, based on continued fractions. The article meticulously explains the algorithm, including computing the continued fraction expansion of a square root and using the resulting coefficients (P and A) for factorization. A step-by-step example demonstrates the algorithm's details, successfully factoring 13290059. This algorithm, historically significant, was the first to achieve sub-exponential factoring time.