Sierpinski problem
The Sierpinski Problem: Definition and Status In 1960 Waclaw Sierpinski (1882-1969) proved the following interesting result. Theorem . There exist infinitely many odd integers k such that k.2n + 1 is composite for every n 1. A multiplier k with this property is called a Sierpinski number. The Sierpinski problem consists in determining the smallest Sierpinski number. In 1962, John Selfridge ...
  www.prothsearch.net/sierp.html reviews
XYYXF - factorizations of x^y+y^x
Factorizations of xy + yx for 1 y x 101 Home News How Status Wanted Results Records Contributors Join us! Reserve Links Contact Welcome to XYYXF project! Integer factorization is one of the most interesting things in computational number theory. First of all it is closely related to cryptography, that's why large networks spend months of CPUtime cracking crypto-keys and number theorists invent ...
xyyxf.at.tut.by/ reviews
Factoring Papers
Factoring Papers Note: many of these papers come from other web sites. If the location of the paper is not mentioned, then it is stored at our web site. Surveys A Survey of Modern Integer Factorization Algorithms by Peter L. Montgomery (zipped, postscript, 132K) from CWI (ftp://ftp.cwi.nl:/pub/pmontgom). Some Parallel Algorithms for Integer Factorization by Richard Brent (zipped, postscript, ...
 www.crypto-world.com/FactorPapers.html reviews
|
Division Rules