Computing Aurifeuillian factors
Algorithm that finds non-trivial factors of certain numbers of the form a^b +/- 1.
Discovery of a Lost Factoring Machine
Built by a French amateur, E.-O. Carissan, around 1919. Shallit, Williams and Morain include photographs and references to their paper.
Factoring Fermat Numbers
Cash prizes for new factors of Fermat numbers Fn, for n = 12 through 22.
Factorization of F10
F10 = 2^(2^10) + 1 is the 10-th Fermat number. Richard Brent describes his discovery of the two largest factors.
Factorization Using the Elliptic Curve Method
Java applet that can be used to find 20- or 30-digit factors of numbers or numerical expressions up to 1000 digits long. It also computes the number and sum of divisors, the Euler'…
N!+-1 Factoring Status
Factoring efforts that have been made so far on numbers of the form n!+-1 using ECM factoring.
Paul Herman's Factoring Page
A thorough summary of many major factoring methods. Includes some source code on many pages, gentle introductions to the more complex methods and further links.
The Anti-Divisor
A definition and description of the Anti-Divisor, and some related results.
Showing 20–11 of 11 results