This package implements primality proving. If ProvablePrimeQ[n] returns True, then the number can be mathematically proven to be prime. In addition, PrimeQCertificate[n] prints a certificate that can be used to verify that is prime or composite.
|ProvablePrimeQ[n]||gives True if n can be proved to be prime, and False if n can be proved to be composite|
|ProvablePrimeQ[n, "Certificate"->True]||prints a certificate that can be used to verify the result|
|PrimeQCertificate[n]||prints a certificate that n is prime or that n is composite|
|PrimeQCertificateCheck[cert,n]||verifies that the certificate cert proves the primality or compositeness of n|
The functions provided in this package not only prove primality, but also generate a certificate of primality. A certificate of primality is a relatively short set of data that can be easily used to prove primality. The word easily means that using the data to prove primality is much easier and faster than generating the data in the first place. As a simple example of a certificate, the factors of a composite number provide a certificate of compositeness. Multiplying the numbers together to show that they are the factors is much easier than finding the factors. The advantage of providing certificates is that the user does not have to trust the internal mechanism of the algorithm that generated the certificate. It is fairly easy to write a program (in any system) that checks that the certificate provides a proof of primality.
This package can also be used to generate certificates of compositeness for composite numbers. These certificates are based on showing that simple properties that are true of prime numbers are not true for the given number. For example, PrimeQCertificate returns the certificate , which is intended to show that is not equal to .
ProvablePrimeQ[n] returns True or False depending on whether n is prime or not. The certificate for primality or compositeness is generated by PrimeQCertificate[n]. ProvablePrimeQ calls PrimeQCertificate and stores the result, so it does not take any extra time to create a certificate once ProvablePrimeQ has returned an answer. The certificate generated by PrimeQCertificate can be checked by PrimeQCertificateCheck. This function recognizes whether the certificate asserts primality or compositeness and then uses the certificate to verify the assertion.
This package is not meant to replace the built‐in primality tester PrimeQ but rather to allow you to be completely secure that a number is truly prime. The package should be used only to certify results after all the number theoretic work has been done. For example, it would be a mistake to use ProvablePrimeQ as a primality test for an integer-factoring algorithm. Rather, only when the complete factorization has been achieved (using PrimeQ for primality testing) would you use ProvablePrimeQ to certify the primality of the prime factors given by the algorithm. The reason for this is that PrimeQ will be, in general, several orders of magnitude faster than ProvablePrimeQ.
|"SmallPrime"||10^50||lower bound for using the Atkin–Morain primality test|
|"Certificate"||False||whether to print a certificate|
|"PollardPTest"||Automatic||whether to apply the Pollard factoring algorithm in the search for the next prime in the recursive certificate|
|"PollardRhoTest"||Automatic||whether to apply the Pollard factoring algorithm in the search for the next prime in the recursive certificate|
|"TrialDivisionLimit"||Automatic||number of primes to be used in the trial division part of PrimeQCertificate|
|"PrimeQMessages"||False||whether to print out the progress of the algorithm|
When is larger than the value of the option , ProvablePrimeQ uses the Atkin–Morain test as described above.