Primaboinca/en: Unterschied zwischen den Versionen
KKeine Bearbeitungszusammenfassung |
(Status changed) |
||
| (Eine dazwischenliegende Version von einem anderen Benutzer wird nicht angezeigt) | |||
| Zeile 1: | Zeile 1: | ||
{{Languages|Primaboinca}} | {{Languages|Primaboinca}} | ||
{{Projekte/en | {{Projekte-ws/en | ||
|Project-Link=[http://www.primaboinca.com/ primaboinca] | |Project-Link=[http://www.primaboinca.com/ primaboinca] | ||
|Screensaver=na.png | |Screensaver=na.png | ||
| Zeile 10: | Zeile 10: | ||
|Start=2010 | |Start=2010 | ||
|End= | |End=May 2020 | ||
|Status= | |Status=finished | ||
|Admin=Fabio Campos | |Admin=Fabio Campos | ||
|Institution=Hochschule Rhein-Main | |Institution=Hochschule Rhein-Main | ||
Aktuelle Version vom 14. Juni 2020, 19:05 Uhr
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 < 10^10 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. |
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
