The greatest common denominator (gcd) is the largest common factor shared by two or more positive integers. In the case of 4,2 the greatest common denominator is 2. Since all integers are divisible by 1, the greatest common denominator of any two integers is guaranteed to be at least 1. If the gcd of two integers is 1, those integers are said to be relatively prime or coprime. In other words, they do not have any common divisors.
It is perhaps obvious on the face there exists a gcd for any two integers and there exists a method for finding this value. Here is the proof. The method for finding the greatest common denominator is found in Euclid's Elements and is therefore known today as Euclid's algorithm. Here is a link to Euclid's proof in the Elements.
But what about quadratic integers? What about Gaussian Integers or Eisenstein Integers? (for those not familiar with quadratic integers, refer to here).
It turns out that if there is a division algorithm available, then for any two integers, there is necessarily a greatest common denominator. In other words, we can prove that Euclid's method for finding the gcd applies. Here is the proof (note: in the example referenced, it refers to Gaussian Integers, but the same proof applies to Eisenstein Integers and other types of quadratic integers that are characterized by a division algorithm).
For this reason, all quadratic integers that are characterized by a division algorithm are said to be Euclidean.
One result of this is that for any two Euclidean integers (quadratic integers that have a division algorithm) that are not relatively prime, it is possible to derive two smaller integers which are relatively prime.
Lemma: gcd(x,y)=d is greater than 1 → there exists X,Y such that x = Xd, y = Yd and gcd(X,Y)=1.
(1) Assume that gcd(X,Y) = D which is greater than 1.
(2) Then D divides X,Y such that there exists X = DX', Y=DY'
(3) And x = DX'd, y = DY'd
(4) So that Dd divides both x and y.
(5) But Dd > d which is impossible since d is the greatest common divisor.
(6) So we reject (1).
Corollary: This result holds for all quadratic integers that are Euclidean.
This is true since the result only depends on the gcd which we showed above holds for all Euclidean Integers.
Lemma: gcd(x,y)=1 → gcd(xn,yn)=1.
(1) Assume that gcd(xn,yn) = d which is greater than 1.
(2) Since d is greater than 1, there must exist a prime p that divides d. [See here for the proof of Fundamental Theorem of Arithmetic]
(3) if p divides xn, then p divides x. [See here for the proof of Euclid's Generalized Lemma]
(4) For the same reason, p would also divide y.
(5) But this is a contradiction since gcd(x,y)=1.
(6) So we reject (1).
Corollary: This holds true for all Euclidean Integers
This proof depends on a proof for unique factorization and Euclid's Generalized Lemma.
(1) Euclid's Generalized Lemma holds true for all Euclidean Integers. [See here for proof].
(2) Unique Factorization holds true for all Euclidean Integers. [See here for proof].