Proof question?
Question Prove that if gcd(a_i, m) = 1 for 1 ≤ i ≤ k, then gcd(a_1*a_2*….*a_k, m) = 1. Answer Prove that if gcd(a_i, m) = 1 for 1 ≤ i ≤ k, then gcd(a_1*a_2*….*a_k, m) = 1. We use “proof by contradiction” method. Let d = gcd (a_1*a_2*….*a_k, m). Let p be ANY...
STAY CONNECTED