Definition of Modular Arithmetic and Congruence
7043
mod [= remainder] operation (and relation), name and meaning
75318
How do you prove that a prime is the sum of two squares iff it is congruent to 1 mod 4?
33735
The square of an integer is congruent to 0 or 1 mod 4
60305
Proving the congruence $p^{q-1}+q^{p-1} \equiv 1 \pmod{pq}$
129381
Modular equation problem
6918
Primes congruent to 1 mod 6
38727
Modular Exponentiation and Primes
115435
Induction: prove using congruences
11500
Divisibility by 7 rule, and Congruence Arithmetic Laws
141704
Fractional exponentiation in modular arithmetic
41673
Solve congruence system $\ x\equiv m_i-1 \pmod{m_i}\,$ for $\,i = 1,\ldots, k$
97196
$k^{\phi(l)} + l^{\phi(k)} \equiv1\pmod{lk}\,$ if $\,\gcd(l,k)=1$
26330
Why can we modular reduce arguments of sums and products in modular arithmetic?
84733
Why $a\equiv b\pmod n$ implies $a$ and $b$ have equal remainder when divided by $n$?
139
Prove or disprove: For every integer a, if a is not congruent to 0 (mod 3), the a^2 is congruent to 1 (mod 3)
73020
Every integer is congruent to the sum of its digits mod 9
2904
Solving linear congruence (modular inverse or fraction) via gcd Bezout equation