In modular arithmetic, why is $\left(g^{k_1} \bmod n\right)^{k_2} \bmod n = \left(g^{k_1}\right)^{k_2} \bmod n$?
138088
Diffie-Hellman key exchange: Why is $(g^{k_1} \bmod n )^{k_2} \bmod n \equiv (g^{k_2} \mod n)^{k_1} \bmod n$
23590
Show that $\gcd\left(\frac{a^n-b^n}{a-b},a-b\right)=\gcd(n d^{n-1},a-b)$
140459
Why is $\left(e^{2\pi i}\right)^i \neq e^{-2 \pi}$?
57654
Congruent Modulo $n$: definition
60665
Meaning of $\mathbb{Z}\left[\sqrt{3}\right]$?
140340
Left and right R-modules
10105
Proving $\, a^b = (a\bmod n)^b\, \pmod{\!n}\ $ [Congruence Power Rule]
49109
Proving $\gcd \left(\frac{a}{\gcd (a,b)},\frac{b}{\gcd (a,b)}\right)=1$
62996
A problem regarding the proof of ${p^nk\choose p^n}\equiv k\mod p$, where $p\nmid k$.
133915
In which case $M_1 \times N \cong M_2 \times N \Rightarrow M_1 \cong M_2$ is true?
158627
$e^{\left(\pi^{(e^\pi)}\right)}\;$ or $\;\pi^{\left(e^{(\pi^e)}\right)}$. Which one is greater than the other?
147665
$a_1=3;\ a_{n+1}=3^{a_n}$; find $a_{2004}\bmod100$
58803
${n \choose k} \bmod m$ using Chinese remainder theorem?
66748
Show that if $a \equiv b \pmod n$, $\gcd(a,n)=\gcd(b,n)$
131905
Proof for exponentiation in modular arithmetic
117538
What is the interpretation of $a \equiv b$ mod $H$ in group theory?
110752
$g^\frac{p-1}{2} \equiv -1 \ (mod \ p)$