The GCD is found by taking the lowest power of all prime factors common to both numbers. Here, the only common prime factor is 2. - AIKO, infinite ways to autonomy.