|
|
见于：http://www.rieselsieve.com/
项目名称：Riesel Sieve ——寻找最小的Riesel(黎瑟尔)数
Riesel(黎瑟尔)问题项目主页：http://www.rieselsieve.com/
Riesel 数和 SOB 项目的 Sierpinski 数很类似，只是k*2^n+1换成k*2^n-1而已。
新闻原文：
Prime found! 234847*2^1535589-1 is prime!
Posted 09 May 2005 by Lee
Congrats to Footmaster....again...for hitting a prime. 462264 digits long and our 18th prime found as a project. This prime is ranked 21st overall of all primes ever found. Soon we will be breaking into the Top 20 primes ever found. Our next project milestone is finding a half million digit prime. Only 78 more primes to find!
A Bryan says:
A new DAT file has been released, with 58,617 fewer pairs in it. This should give users a small speed increase for sieving. It is available on the download page, as always. |
|
发表于 2005-5-12 06:08:26