If the gcd(a,n)=1, show that there is an integer b congruent to a (mod n), where b has no prime factors less than any arbitrary integer k. ?????
Follow Math Help Forum on Facebook and Google+
i did not understand the question. can you make it clear by giving an example, that is, by taking say a= 6, n=13 so that gcd(a,n)=1.
View Tag Cloud