Modular arithmetic question...
5037
Find the last two digits of $3^{45}$
36031
Finding modular of a fraction
52530
There exists a prime congruent to $m$ mod $p$
34430
Why does $(\frac{p-1}{2}!)^2 = (-1)^{\frac{p+1}{2}}$ mod $p$?
45882
Solving a congruence without Fermat's little theorem
114346
Why is $a^{-1}$ mod $p$ equal to $a^{p-2}$ mod $p$?
66785
Find $\gcd(p^n-1,p^m+1)$.
77533
What solutions does the equation 4x≡2mod10 have? (Hint, it will have more that one.) What about solutions to an equation ax≡dmodn, where d=gcd(a,n)?
105719
Complex numbers modulo integers
97196
$k^{\phi(l)} + l^{\phi(k)} \equiv1\pmod{lk}\,$ if $\,\gcd(l,k)=1$
126816
Question of remainder on dividing by 7
70392
System of congruences with variable
81058
Evaluate $6^{433} \pmod {21}$ and a proving question
144067
calculating $a^b \!\mod c$
29204
$a\equiv\bar a\!\pmod{\!kn}\Rightarrow a\equiv\bar a\!\pmod{\! n};\ $ $(a\bmod kn)\bmod n=a\bmod n.\ $ Congruences persist mod factors of the modulus
13317
show that $a^{12} \equiv 1 \mod 32760$ for each $a \in \mathbb{Z}$ such that $\text{gcd}(a, 32760) = 1$
72360
Find the value of $a^{2m}+a^m+{1\over a^m}+{1\over a^{2m}}$