1
In a recent press release off the Great Internet Mersenne Prime Search distributed computing project page, it is announced that
$$2^{82589933} - 1$$
is the largest known (Mersenne) prime, corresponding to the $51^{\text{st}}$ known even perfect number
$$2^{82589932}(2^{82589933} - 1).$$
Accordin...
In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations.
== See also ==
Computational complexity of mathematical operations
SageMath
Number Theory Library
PARI/GP
Fast Library for Number Theory
== Further reading ==
Eric Bach and Jeffrey Shallit, Algorithmic Number Theory, volume 1: Efficient Algorithms. MIT Press, 1996, ISBN 0-262-02405-5
D. M. Bressoud (1989). Factorisation and Primality Testing. Springer-Verlag. ISBN 0-387-97040-1.Buhler, J.P.; P., Stevenhagen, eds. (2008...
