Calculate the Greatest Common Divisor (GCD) of two or more numbers using the efficient Euclidean algorithm.
The Greatest Common Divisor (GCD) of two or more numbers is the largest positive integer that divides each number without remainder.
The most efficient method to find GCD of two numbers a and b:
GCD(a, b) = GCD(b, a mod b) until b = 0
GCD(48, 18):
48 = 18 x 2 + 12
18 = 12 x 1 + 6
12 = 6 x 2 + 0
Result: GCD(48, 18) = 6
