List the numbers
Find the prime factors of each number
Identify the common prime factors
Multiply the common prime factors
The result is the GCD
Or use the Euclidean algorithm
Divide the larger number by the smaller number
Replace the larger number with the smaller number
Replace the smaller number with the remainder
Repeat until the remainder is 0
The last nonzero remainder is the GCD