I have found an algorithm called the Binary GCD/Stein Algorithm which takes two non-negative integers and finds the greatest common factor of the two.
What I am trying to do is take three numbers and find if each pair is relatively prime (where the GCD is one). For example, if I have non-negative variables
a = 1 b = 1 c = 2
Would satisfy this because none of these numbers have a GCD that is larger than one. Using a variation of the Stein Algorithm in Java, I would like to be able to find the GCD of all three pairs of numbers (
ac) with each side being able to go up to five, for the sake of simplicity.
Is there a way I could tweak the algorithm to compute the GCD of three numbers, or would I have to compute three groups of two pairs?
Thanks for any and all help.