PRODUCTS
PURCHASE
FOR USERS
COMPANY
OUR SITES
DOCUMENTATION CENTER SEARCH
Mathematica
>
Number Theoretic Functions
>
Built-in
Mathematica
Symbol
Integer and Number Theoretic Functions
Tutorials »
|
Divisible
GCD
Mod
PrimeQ
EulerPhi
See Also »
|
Integer Functions
Number Theoretic Functions
Prime Numbers
Testing Expressions
New in 6.0: Mathematics & Algorithms
New in 6.0: Number Theory & Integer Functions
More About »
CoprimeQ
CoprimeQ
[
n
1
,
n
2
]
yields
True
if
n
1
and
n
2
are relatively prime, and yields
False
otherwise.
CoprimeQ
[
n
1
,
n
2
,
...
]
yields
True
if all pairs of the
n
i
are relatively prime, and yields
False
otherwise.
MORE INFORMATION
The
n
i
can be Gaussian integers.
EXAMPLES
CLOSE ALL
Basic Examples
(1)
8, 9 and 11 are relatively prime:
In[1]:=
Out[1]=
Scope
(2)
Generalizations & Extensions
(1)
Applications
(3)
Neat Examples
(2)
SEE ALSO
Divisible
GCD
Mod
PrimeQ
EulerPhi
TUTORIALS
Integer and Number Theoretic Functions
MORE ABOUT
Integer Functions
Number Theoretic Functions
Prime Numbers
Testing Expressions
New in 6.0: Mathematics & Algorithms
New in 6.0: Number Theory & Integer Functions
New in 6
© 2008 Wolfram Research, Inc.
EXAMPLES
Basic Examples 
Scope 