|
楼主 |
发表于 2005-1-1 18:12:14
|
显示全部楼层
英文介绍:

Help find the smallest Sierpinski number in Seventeen or Bust, a distributed attack on the Sierpinski problem. The project looks for Proth prime numbers in which, for a number k, if every possible choice of n results in a composite (non-prime) Proth number N, k is a Sierpinski number.
The project began its k=33661 project on November 21, 2002, and fifteen additional projects on November 23, 2002. It has found the following primes:
Prime Number of digits Date found
(46157 * 2^698207) + 1 210,186 November 27, 2002
(65567 * 2^1013803) + 1 305,190 December 3, 2002
(44131 * 2^995972) + 1 299,823 December 5, 2002
(69109 * 2^1157446) + 1 348,431 December 7, 2002
(54767 * 2^1337287) + 1 402,569 December 22, 2002
(5359 * 2^5054502) + 1 1,521,561 December 15, 2003
To participate in the project, sign up for an account,download the client, add your account name to the client configuration, and run it. The client does Proth tests on individual numbers. Each number should take a few hours to test on an average machine. When the project server assigns you a number, it waits for up to 10 days for you to return your search results, and reassigns the number to someone else if it doesn't receive your results within that time.
The client supports users behind firewalls and proxy servers. Version 2.2 of the client is available for Windows, Linux, FreeBSD, and BeOS as of December 11, 2004.
Seventeen or Bust also has a supporting project to sieve numbers for the main project: sieving finds n numbers with small factors and removes them from the pool of prime number candidates which need to be tested by Seventeen or Bust. Two clients are available for sieving: SoBSieve (for Windows) and NBeGone (for multiple platforms). To reserve a range of numbers to sieve, post a message to the sieve coordination thread. Then submit the results from the range to the "sieve numbers" page mentioned above.
Join a discussion forum about the project.
[ Last edited by 碧城仙 on 2005-1-1 at 06:17 PM ] |
|