Revision history [back]
 | 1 | initial version |
The method for determining if two numbers are relatively prime is to find their greatest common divisor (GCD) using an algorithm such as Euclid's algorithm. If the GCD is 1, then the two numbers are relatively prime. If the GCD is greater than 1, then they are not relatively prime as they have a common factor.