Theorems on Modular Arithmetic
36602
$a^m=b^m$ and $a^n=b^n$ imply $a=b$
44033
Number theory lemma - $x^2 \equiv 1 \pmod p$ implies $x\equiv\pm 1\pmod p$
40087
Using Modularity Theorem and Ribet's Theorem to disprove existence of rational solutions
52530
There exists a prime congruent to $m$ mod $p$
58803
${n \choose k} \bmod m$ using Chinese remainder theorem?
73238
Show that $a^{q-1} \equiv 1 \pmod{pq}$
30630
Proving ${n \choose p} \equiv \Bigl[\frac{n}{p}\Bigr] \ (\text{mod} \ p)$
73095
Foundational proof for Mersenne primes
36031
Finding modular of a fraction
360
Modular exponentiation by hand ($a^b\bmod c$)
60305
Proving the congruence $p^{q-1}+q^{p-1} \equiv 1 \pmod{pq}$
71821
How do I derive the time complexity of encryption and decryption based on modular arithmetic?
128634
Doubt related to a theorem in congruences of Chapter 5 of Apostol Introduction to analytic number theory
52774
Computing an infinite sum using the Residue theorem
118955
Specific steps in applying the Chinese Remainder Theorem to solve modular problem splitting modulus
110703
How Can I prove (a+b) mod m = (a mod m) + (b mod m)) mod m?
135986
Show if $a \equiv b \pmod{m}$ then $ac \equiv bc\pmod{mc}$