Using the Division and Euclidean Algorithm in Z[i], Superquiz 3 Problem 1

Given two Gaussian integers, we first apply the division algorithm (showing that there are options for both the quotient and remainder) and then apply the Euclidean algorithm (just repeatedly using the division algorithm) to show that the given Gaussian integers are relatively prime.