This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
 MATHEMATICA GUIDE Functions »| More About »| Tutorials »
Prime Numbers
The primes have been a focal point for investigations of numbers for more than two millennia. Mathematica implements state-of-the-art algorithms for handling both primes and the advanced mathematics that has grown up around their study. Use Prime to quickly find the billionth prime, or Zeta to get empirical evidence related to the Riemann hypothesis.
Generating Primes
Prime the n prime number
NextPrime next, previous, etc. prime
RandomPrime pick a random prime
PrimePi the number of primes up to n
Zeta Riemann zeta function
ZetaZero zeros of the zeta function
Primality Testing
PrimeQ test if a number is prime
PrimePowerQ test if a number is a prime power
CoprimeQ test if numbers are coprime
Theorems & Equations
Primes the domain of primes
Reduce reduce equations over the primes
FindInstance find Diophantine solutions over the primes
FullSimplify simplify assuming numbers are prime
Factoring
FactorInteger find the factors of an integer