Can someone explain the following modular arithmetic?
18767
How do you find the modular inverse of $5\pmod{\!11}$
29231
Proof of : $x^{n}\equiv x^{\varphi(m)+[n \bmod \varphi(m)]} \mod m$
127816
Number theory proof mod p
102398
Help deriving that $\mathrm{sign} : S_n\to \{\pm 1\}$ is multiplicative
121122
Calculate $2^{5104} \bmod 10$ using mental arithmetic
60305
Proving the congruence $p^{q-1}+q^{p-1} \equiv 1 \pmod{pq}$
55049
How to find the inverse modulo $m$?
52483
Showing that $(m)\cap (n)=(\operatorname{lcm}(m,n))$ and $(m)+(n)=(\gcd(m,n))$ for any $m,n\in\mathbb{Z}$
74898
$1^n +2^n + \cdots +(p-1)^n \mod p =$?
71821
How do I derive the time complexity of encryption and decryption based on modular arithmetic?
107866
How is information disclosed by modular multiplication?
30045
Solving linear congruences by hand: modular fractions and inverses
38727
Modular Exponentiation and Primes
146053
Proving identities (mod $pq$) using Fermat's little theorem?
147564
Why does $(A/I)\otimes_R (B/J)\cong(A\otimes_R B)/(I\otimes_R 1+1\otimes_R J)$?
21108
Perfect squares and modularly congruency in mod 5
83753
Why $\,p \cdot (p^{-1} \mod q) + q \cdot (q^{-1} \mod p) = pq + 1$?