Classical Methods of Factorization
Hans Riesel · Birkhäuser Boston eBooks · 2011
The art of factoring large integers was not very advanced before the days of the modern computer. Even if there existed some rather advanced algorithms for factorization, invented by some of the most outstanding mathematicians of all times, the amount of computational labor involved discouraged most people from applying those methods to sizable problems. So the field essentially belonged to a few enthusiasts, who however achieved quite impressive results, taking into account the modest means for calculations which they possessed. Famous among these results is F. N. Cole’s factorization in 1903 of 2 67 − 1 = 193707721 ∙ 761838257287. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.