The GCF is the largest positive integer that divides both numbers.

Steps

1. List prime factors of each number.
2. Multiply the shared primes with the smaller exponents.
3. Or use the Euclidean algorithm: repeatedly replace (a, b) with (b, a mod b).