primaboinca project description

Forum rules
User avatar
[ TSBT's Pirate ]
[ TSBT's Pirate ]
Posts: 10120
Joined: Thu Oct 04, 2012 1:22 pm
Location: roaming the planet
Has thanked: 20 times
Been thanked: 41 times

#1 primaboinca project description

Post by Alez » Thu Oct 31, 2013 8:01 pm

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.
The best form of help from above is a sniper on the rooftop....

Return to “Primaboinca”

Who is online

Users browsing this forum: No registered users and 1 guest