- PrimeQ gives False.
- PrimeQ[-n], where n is prime, gives True.
- PrimeQ[n, GaussianIntegers->True] determines whether n is a Gaussian prime.
- PrimeQ[m+In] automatically works over the Gaussian integers.
- Simplify[exprPrimes] can be used to try to determine whether a symbolic expression is mathematically a prime.
New in 1 | Last modified in 5