Wolfram ResearchPRODUCTSPURCHASEFOR USERSCOMPANYOUR SITES
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.

PrimeQ

Usage

PrimeQ[expr] yields True if expr is a prime number, and yields False otherwise.


Notes

PrimeQ[1] gives False.
PrimeQ[-n], where n is prime, gives True.
PrimeQ[n, GaussianIntegers->True] determines whether n is a Gaussian prime.
PrimeQ[m + I n] automatically works over the Gaussian integers.
Simplify[expr  Primes] can be used to try to determine whether a symbolic expression is mathematically a prime.
• Implementation notes: see Section A.9.4.
• See also: FactorInteger, Primes.
• Related package: NumberTheory`PrimeQ`.
• New in Version 1.


Any questions about topics on this page? Click here to get an individual response.Buy NowFree TrialMore Information



 © 2009 Wolfram Research, Inc.  Terms of Use  Privacy Policy |
Sign up for our newsletter: