Factoring numbers is a concept learnt with the introduction of divisibility in schools, yet the process can be exceptionally challenging and difficult. This category addresses topics from the basic divisibility tests to perfection and the general problem of extracting prime factors.
Related categories 2
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.
The Factor Zone
Aimed at grade school students and teachers, includes course guidelines, worksheets, and factor tables up to 600.
Links to papers on the theory and practice of factoring.
Online calculator that factorizes large numbers, specified by formula.
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's totient and moebius functions, and the decomposition of the number in a sum of up to four squares.
Factorizations of Near-repdigit Numbers
Factorizations of numbers composed of all the same digit except first and/or last.
Dedicated to algorithms and computational results on integer factorization. Includes links to papers, downloadable software, and online resources.
Leonid Durman's Fermat number factoring site and program.
Paul Leyland's list of his own and other factorisations.
The XYYXF Project
A collaborative project to produce the factorizations of x^y + y^x for 1<y<x<101.
Factoring Fermat Numbers
Cash prizes for new factors of Fermat numbers Fn, for n = 12 through 22. (December 31, 2004)
Factorization of RSA-155
Announcement of factorization of a 512-bit RSA key using the General Number Field Sieve (GNFS). (August 22, 1999)
Last update:December 22, 2016 at 9:15:06 UTC