prove that if n and m are relatively prime, gcd(n,m)=1, then |U(n)|*|U(m)|=|U(nm)|
Follow Math Help Forum on Facebook and Google+
Originally Posted by mandy123 prove that if n and m are relatively prime, gcd(n,m)=1, then |U(n)|*|U(m)|=|U(nm)| Define by . Show this is well-defined. Now prove this is a bijection by using Chinese remainder theorem.
View Tag Cloud