Assume that a, b, and c are integers for which gcd(a, b) = 1 and gcd(a, c) = 1. Prove that gcd(a, bc) = 1.
a) Apply the Euclidean algorithm
b) Use prime factorization
c) Prove by contradiction
d) Apply Bezout's identity