- #1

- 8

- 0

## Main Question or Discussion Point

**Prove that if**

*and [j] are equivalence classes modulo*

1. Prove that if

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.

plz help2. Prove that if gcd(a,b)=1 and if c divides b, then gcd(a,c)=1.

plz help