Thread
:
Number theory: gcd(a,b)=1 => for any n, gcd(a+bk,n)=1 for some k
View Single Post
morphism
#
2
Mar8-12, 11:45 PM
Sci Advisor
HW Helper
P: 2,020
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?