5
$\begingroup$

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.

  • 0
    See Remark 3.3 of http://www.math.uconn.edu/~kconrad/blurbs/ugradnumthy/eulerthm.pdf, especially equation (3.2). Look also at the two references mentioned at the end of the remark.2014-12-19

1 Answers 1

1

Are you looking for something like the following?

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