primaboinca
Posted: Tue Nov 02, 2010 8:35 pm
This has been running a couple of months but I've only just noticed it! (One for John's stats as well by the look of it!)
We're only 37th in the World and just 3rd in the UK
http://www.primaboinca.com/
No idea what it's like as I only found it 5 minutes ago!
If that helps!About primaboinca
PRIMABOINCA is a research project that uses Internet-connected computers to search for a counterexample to some conjectures.
This project concerns itself with two hypotheses in number theory. Both are conjectures for the identification of prime numbers. The first conjecture (Agrawal’s Conjecture) was the basis for the formulation of the first deterministic prime test algorithm in polynomial time (AKS algorithm). Hendrik Lenstras and Carl Pomerances heuristic for this conjecture suggests that there must be an infinite number of counterexamples. So far, however, no counterexamples are known. This hypothesis was tested for n < 1010 without having found a counterexample. The second conjecture (Popovych’s conjecture) adds a further condition to Agrawals conjecture and therefore logically strengthens the conjecture. If this hypothesis would be correct, the time of a deterministic prime test could be reduced from O(log N)6 (currently most efficient version of the AKS algorithm) to O(log N)3.
We're only 37th in the World and just 3rd in the UK
http://www.primaboinca.com/
No idea what it's like as I only found it 5 minutes ago!