Can this congruence rule be generalized?
119433
How to find modulo of large numbers like $9801\! \pmod {\!32}$
9414
Is There a Natural Way to Extend Repeated Exponentiation Beyond Integers?
145617
Is there any simple trick to solve the congruence $a^{24}\equiv6a+2\pmod{13}$?
110809
What can primes, except 2, 3, and 5, be congruent to $\pmod {30}$?
80535
Linear congruence fill in the missing step?
36713
Solving multiple congruences by CRT = Chinese Remainder Theorem
121920
Can there be multiple paths for which Fermat's least time principle can be obeyed?
134450
Chinese Remainder Theorem $\ x\equiv m_k-2\pmod{m_k}$
68252
Chinese Remainder Theorem solvability for non-coprime moduli
97196
$k^{\phi(l)} + l^{\phi(k)} \equiv1\pmod{lk}\,$ if $\,\gcd(l,k)=1$
59987
Power rule for Logarithms
33851
Generalizing a sequence.
19071
solution set for congruence $x^2 \equiv 1 \mod m$
73020
Every integer is congruent to the sum of its digits mod 9
52530
There exists a prime congruent to $m$ mod $p$
42723
Lattices are congruence-distributive
6332
If $p\equiv1\mod{4}$, then $p=a^{2}+b^{2}$ where a and b are uniquely determined