Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

It is well known that if $\gcd(a,n)=1$, then $a^{ϕ(n)}=1$ mod $n$.

Are there any results similar to Euler's theorem that can be used when $a$ and $n$ are not coprime.

Feel free to add any restrictions on $a$, $n$ other than $a$, $n$ being coprime.

Thank you.

share|cite|improve this question
What do you mean by "similar" and "can be used"? If your ultimate motive is to calculate $a^m \bmod n$, then you can easily get $a^m \bmod p^k$ for all the prime powers in the prime factorization of $n$, and use the Chinese remainder theorem to put them together. – ShreevatsaR Nov 12 '12 at 4:06
See Remark 3.3 of, especially equation (3.2). Look also at the two references mentioned at the end of the remark. – KCd Dec 19 '14 at 20:11

Are you looking for something like the following?

$$\text{For any integers $a$ and $n$, $a^{n} \equiv a^{n-\varphi(n)} \pmod{n}$.}$$

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.