Prove that if (a, b) = 1 and a divides be, then a divides c. More generally, show that if a divides be with nonzero a, b, then a divides c.

a) Fermat's Little Theorem
b) Euclidean Algorithm
c) Wilson's Theorem
d) Chinese Remainder Theorem