PRODUCTS
Mathematica
Mathematica Home Edition
Mathematica for Students
Mathematica for the Classroom
grid
Mathematica
Wolfram Lightweight Grid Manager
web
Mathematica
Mathematica Player
(free download)
Mathematica Player Pro
Wolfram
Workbench
Mathematica
Applications
SOLUTIONS
Industry
Chemical Engineering
Image Processing
Mechanical Engineering
Petroleum Engineering
Environmental Sciences
Bioinformatics
Data Analysis and Mining
Financial Risk Management
Statistics
Software Engineering
More...
Education
Higher Education
Precollege Education
Students
Technology
Interactive Deployment
High-Performance and Parallel Computing (HPC)
See Also: Technology Guide
PURCHASE
Online Store
Other Ways to Buy
Volume & Site Licensing
Contact Sales
Software
Service
Upgrades
Training
Books
FOR USERS
All User Resources
Product Registration
Technical Support
Customer Service
Developer Support
Does My Site Have a License?
Free Seminars
Learning Center
Training
Custom Group Seminars
Documentation & Examples
Tutorial Screencasts
Video Gallery
Demonstrations Project
Education Portal
Student Resources
COMPANY
About Wolfram Research
News & Events
Wolfram Blog
Employment Opportunities
History of
Mathematica
Stephen Wolfram's Home Page
Contact Us
OUR SITES
Wolfram|Alpha
Demonstrations Project
Wolfram Blog
MathWorld
Integrator
Wolfram Functions Site
Mathematica Journal
Wolfram Library Archive
Wolfram
Tones
Wolfram Science
Stephen Wolfram
DOCUMENTATION CENTER SEARCH
Mathematica
>
Mathematics and Algorithms
>
Mathematical Functions
>
Number Theoretic Functions
>
Built-in
Mathematica
Symbol
Putting Constraints on Patterns
Types of Numbers
Integer and Number Theoretic Functions
Tutorials »
|
FactorInteger
Prime
NextPrime
Primes
PrimePowerQ
CoprimeQ
GCD
See Also »
|
Cryptographic Number Theory
Integer Functions
Number Recognition
Number Theoretic Functions
Number Theory
Prime Numbers
Testing Expressions
More About »
PrimeQ
PrimeQ
[
expr
]
yields
True
if
expr
is a prime number, and yields
False
otherwise.
MORE INFORMATION
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.
EXAMPLES
CLOSE ALL
Basic Examples
(1)
Test whether a number is prime:
In[1]:=
Out[1]=
In[2]:=
Out[2]=
Scope
(1)
Generalizations & Extensions
(1)
Applications
(3)
Neat Examples
(3)
SEE ALSO
FactorInteger
Prime
NextPrime
Primes
PrimePowerQ
CoprimeQ
GCD
TUTORIALS
Putting Constraints on Patterns
Types of Numbers
Integer and Number Theoretic Functions
RELATED LINKS
Demonstrations with PrimeQ
(
Wolfram Demonstrations Project
)
Implementation notes: Numerical and Related Functions
NKS|Online
(
A New Kind of Science
)
MORE ABOUT
Cryptographic Number Theory
Integer Functions
Number Recognition
Number Theoretic Functions
Number Theory
Prime Numbers
Testing Expressions
New in 1 | Last modified in 5
EXAMPLES
Basic Examples 
Scope 