(adsbygoogle = window.adsbygoogle || []).push({}); Prove that ifand [j] are equivalence classes modulo

1. Prove that ifand [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 help

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Prove that if and [j] are equivalence classes modulo

Loading...

Similar Threads - Prove equivalence classes | Date |
---|---|

I Proving that an operator is unbounded | Feb 8, 2018 |

I What is the equivalent of a group in category theory? | Nov 7, 2017 |

I Proving a set is linearly independant | Apr 14, 2017 |

I Proving a property when elements of a group commute | Mar 29, 2017 |

**Physics Forums - The Fusion of Science and Community**