• Primaboinca

    by Published on 09-02-11 11:37 PM  Number of Views: 918 


    Description: 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.


    Institution: Hocschute RheinMain University of Applied Sciences Wiesbaden.


    Home Page:http://www.primaboinca.com/


    Project Status Active.


    Client Programs: The project supports the following Applications:
    Windows 32bit.
    Linux 32bit.
    Mac OS.
    Cell BE.


    Statistics View Detailed Information and statistics about Team SETI.USA Here


    Current Team Scores:






  • Calendar

    April   2017
    Su Mo Tu We Th Fr Sa
    1
    2 3 4 5 6 7 8
    9 10 11 12 13 14 15
    16 17 18 19 20 21 22
    23 24 25 26 27 28 29
    30