Number theory: gcd(a,b)=1 => for any n, gcd(a+bk,n)=1 for some k

morphism

If a and n have gcd other than 1 then there will be a prime p dividing both of them. Now suppose that p divides a+bk. What can you say now?

morphism Recognitions: Homework Help Science Advisor	If a and n have gcd other than 1 then there will be a prime p dividing both of them. Now suppose that p divides a+bk. What can you say now?