Prime Sierpinski Project (PSP)-
The Prime Sierpinski project (PSP) is a mathematical project involved in the search of large prime numbers. Prime numbers are numbers, which are divisible by 1 and by themselves and not by any other numbers. It has been proved that there are an infinite number of prime numbers but no one has been able to prove anything about the distribution of prime numbers in general. It is a mysterious frontier of mathematics.
We look at a special class of prime numbers called proth numbers which have the general formula k*2^n+1. We further specialize our search by looking at numbers for which k is prime in k*2^n+1. Further more it has been proven that there exists an infinite number of prime k's such that k*2^n+1 can never be prime. These k's are called prime sierpinski numbers.
Hey it sounds interesting, and we have no representation in the Mathematical Project section over at DC Vault, so I figured this would be a way to help us climb the ranks a bit more.
I'm the only team member right now, but any who wish to join are welcome!
To get informed and started, visit this forum thread here:
Download the client here(might be better to stick with the PRP client rather than sieve, since DC Vault has a category for both):
Join the nForcersHQ.com team here(post a reply in the thread to Citrix asking to put you on the nForcersHQ.com team):
Track stats here:
(updated about every 30 minutes)
http://stats.free-dc.org/new/teamstats. ... cersHQ.com
Feel free to ask me or post on the PSP at mersenneforum.org if you have any questions.
By the way, the PRP client runs at the lowest priority, so if you want another project to have higher priority, just bump its priority up a notch. Unfortunately, there's no way to explicitly set a max CPU percentage. But with UD set one notch higher, it generally splits it about 80%UD/20%PRP, with other processes taking their pieces now and then, of course.
If I've left out anything important, let me know!