- Thread starter
- #1

Let d=gcd(k,l)

Prove that a^d=1 (mod m).

I get already confused at the start: Is it true that k|phi(m) (Lagrange) but k can also be a multiple of the order of a (mod m) and then it can be the other way round.

Can anybody clarify this and give me a direction to start working? Thanks!