Two integers are relatively prime (or co prime ) if they have no common factors other than 1.
For example, 21 = 3 × 7 and 35 = 5 × 7 are not relatively prime because they are both divisible
by 7. By definition –1 and 1 are relatively prime to every integer, and they are the only
numbers relatively prime to 0.
Suppose you’ve written an efficient Is Relatively Prime method that takes two integers
between –1 million and 1 million as parameters and returns true if they are relatively prime.
Use either your favorite programming language or pseudo code (English that sort of looks like
code) to write a method that tests the Is Relatively Prime method. (Hint: You may find it
useful to write another method that also tests two integers to see if they are relatively prime.)