List the numbers
Find their common factors
Identify the greatest common factor
Use prime factorization
Break each number into prime factors
Multiply the common prime factors
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