findGreatestCommonDivisor
The method computes the greatest common divisor of two numbers by recursively applying the Euclidean algorithm: gcd(a, 0) = a gcd(a, b) = gcd(b, a mod b)
The method computes the greatest common divisor of two numbers by recursively applying the Euclidean algorithm: gcd(a, 0) = a gcd(a, b) = gcd(b, a mod b)