Qurak
Documentation
Pricing
Sign in
Qurak
Documentation
Functions
CoprimeQ
CoprimeQ
Available
Tests if two integers are coprime.
Forms
CoprimeQ[n1, n2]
CoprimeQ[n1, n2, …]
Verified examples
CoprimeQ[3, 5] → True
CoprimeQ[6, 9] → False
CoprimeQ[14, 15] → True
CoprimeQ[1 + 2 I, 2 + I] → True
Run this on Qurak
Search the reference
Topics
Integer Functions
- Division-Related Functions
New In60 Alphabetical Listing
- C
New In60 Mathematics And Algorithms
- New in Number Theory & Integer Functions »
New In60 Number Theory And Integer Functions
- New Divisibility-Related Functions
Number Theoretic Functions
- Divisibility
Prime Numbers
- Primality Testing
Related
GCD
Divisible
Mod
PrimeQ
CompositeQ
FactorInteger
EulerPhi
Prime
ChineseRemainder
EvenQ
KroneckerSymbol
LCM
← CoplanarPoints
Coproduct →
All 6300 functions
·
Use this from an MCP client