Online calculator that factorizes large numbers, specified by formula.
Aimed at grade school students and teachers, includes course guidelines, worksheets, and factor tables up to 600.
An analysis of problems relating to the numbers k.2^n+1, primes, and factor patterns, including the Sierpinski problem.
Sierpinski proved there exist infinitely many odd integers k such that k*2^n+1 is composite for every n. Ray Ballinger coordinates a search to prove or disprove whether k=78557 is the smallest solution.
Factoring efforts that have been made so far on numbers of the form n!+1 using ECM factoring.
Article about SNFS factorisation of 3^3491.
Divisibility, primes and binary numbers.
Java applet that can be used to find 20 or 30digit 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.
Leonid Durman's Fermat number factoring site and program.
A definition and description of the AntiDivisor, and some related results.
Computers /
Computer_Science /
Distributed_Computing /
Projects /
Cryptography
