# Math Help - Order of an element

1. ## Order of an element

Suppose that gcd(a,n)=1, m|n, then order of a in m divides order of a in n.

2. 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 $k$ be order of $a$ mod $m$ and $r$ be order of $a$ mod $n$. Then it means $a^k\equiv 1(\bmod m)$ and $a^r\equiv 1(\bmod n)$. But since $m|n$ it means $a^r\equiv 1(\bmod m)$. Since $k$ is the order mod $m$ it means $k|r$.