This is documentation for Mathematica 6, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.1)


gives True if n is provably prime, and False otherwise.
  • When ProvablePrimeQ[n] returns True, then n is prime based on the Pratt certificate of primality or the Atkin-Morain certificate of primality.
  • ProvablePrimeQ should not be used as a replacement for PrimeQ, as PrimeQ is several orders of magnitude faster. Instead, use ProvablePrimeQ to certify the results of PrimeQ when needed.
  • The following options can be given:
"SmallPrime"1050lower bound for using the Atkin-Morain test
"Certificate"Falsewhether to print a certificate
"PollardPTest"Automaticwhether to use the Pollard p-1 method
"PollardRhoTest"Automaticwhether to use the Pollard method
"TrialDivisionLimit"Automaticnumber of primes to use in trial division
"PrimeQMessages"Falsewhether progress is to be monitored