dual Sierpinski problem Налаштування

[nikelong]

dual Sierpinski problem


http://sierpinski.insider.com/dual

 

http://www.rechenkraft.net/wiki/index.php?...Dual_Sierpinski

The dual Sierpinski problem search tried to find a prime in each sequence of integers of the form k + 2n (fixed k) for which no prime had yet been found. The project was coordinated by Payam Samidoost, an active researcher of Fermat numbers. The project used George Woltman's PRP software (available for Windows and Linux).

Це повідомлення відредагував nikelong: Aug 30 2010, 00:00