Suppose that gcd(a,n)=1, m|n, then order of a in m divides order of a in n.
Follow Math Help Forum on Facebook and Google+
Originally Posted by tttcomrader Suppose that gcd(a,n)=1, m|n, then order of a in m divides order of a in n. Let be order of mod and be order of mod . Then it means and . But since it means . Since is the order mod it means .
View Tag Cloud