- #1
leilei
- 8
- 0
Prove that if and [j] are equivalence classes modulo
1. Prove that if and [j] are equivalence classes modulo n such that =[j], then gcd(i,n)=gcd(j,n)
2. Prove that if gcd(a,b)=1 and if c divides b, then gcd(a,c)=1.
please help
1. Prove that if and [j] are equivalence classes modulo n such that =[j], then gcd(i,n)=gcd(j,n)
2. Prove that if gcd(a,b)=1 and if c divides b, then gcd(a,c)=1.
please help