Provable prime

From Wikipedia, the free encyclopedia

In number theory, a provable prime is an integer that is calculated to be prime using a primality-proving algorithm.

[edit] See also

Image:Integer.gif  This number article is a stub. You can help by expanding it.
Retrieved from "http://en.wikipedia.org../../../p/r/o/Provable_prime.html"