The GCD (Great Common Divisor) is used in many cryptography methods, and is determined by the latest divisor that goes into two numbers. For example, the GCD of 9 and 15 is 3. Find the GCD of the following:

The GCD of 15 and 12 is 3, as 3 is the largest divisor that can go into both of these values.