Help in Modular Arithmetic
360
Modular exponentiation by hand ($a^b\bmod c$)
380
Bijection from modular multiplication?
134450
Chinese Remainder Theorem $\ x\equiv m_k-2\pmod{m_k}$
45014
Modular exponentiation by repeated squaring
111555
Find $a,b \in \mathbb{N}$ with $\mathrm{lcm}(a,b)=12\gcd(a,b)\,$ and $\,a\bmod b = 5$
52530
There exists a prime congruent to $m$ mod $p$
41673
Solve congruence system $\ x\equiv m_i-1 \pmod{m_i}\,$ for $\,i = 1,\ldots, k$
105225
Number Theory: Complete set of residues modulo $n$
9787
Primitive roots modulo primes congruent to n!
30045
Solving linear congruences by hand: modular fractions and inverses
131731
Primes that can't be written as sum of two squares. Mod
9039
What is the best way to solve modular arithmetic equations such as $9x \equiv 33 \pmod{43}$?
58803
${n \choose k} \bmod m$ using Chinese remainder theorem?
150446
Quadratic Modular Arithmetic
158684
How to solve and see resolution of $13^{53} \pmod 7$ using Fermat little Theorem?
18767
How do you find the modular inverse of $5\pmod{\!11}$
101057
Show that $1^{p-1} + 2^{p-1} +\ldots + (p-1)^{p-1} \equiv -1 \mod p$