Tool to test / find / check co-prime numbers (relatively prime). Two (or more) Integers are called coprimes if their GCD (greatest common divisor) is equal to 1.
Coprimes - dCode
Tag(s) : Arithmetics
dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!
Example: GCD(4,6) = 2, then 4 and 6 are not coprimes.
Example: GCD (4,5,6) = 1 then 4, 5 and 6 are coprimes, but not pairwise comprime as 4 and 6 are not relatively primes.
Example: GCD (7,12) = 1 then 7 and 12 are coprimes.
According to the definition, yes, 1 and 1 are coprimes as GCD(1,1)=1. Moreover 1 and any positive integer are relatively primes.
The copy-paste of the page "Coprimes" or any of its results, is allowed as long as you cite the online source
Reminder : dCode is free to use.