Write an alternative gcd algorithm based on the following observations (arrange so that a > b):
a. gcd(a, b) = 2gcd(a/2, b/2) if a and b are both even.
b. gcd(a, b) = gcd(a/2, b) if a is even and b is odd.
c. gcd(a, b) = gcd(a, b/2) if a is odd and b is even.
d. gcd(a, b) = gcd((a + b)/2, (a − b)/2) if a and b are both odd.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.