Which theorem is used to reduce a linear congruence here?
11500
Divisibility by 7 rule, and Congruence Arithmetic Laws
87926
Pumping Lemma for $L=\left\{0^i 1^{j} \mid \gcd(i,j) = 1\right\}$
93820
Fermat's little theorem applied for $n$'th root existence $\!\bmod p$
2904
Solving linear congruence (modular inverse or fraction) via gcd Bezout equation
946
How to find solutions of linear Diophantine ax + by = c?
128634
Doubt related to a theorem in congruences of Chapter 5 of Apostol Introduction to analytic number theory
93121
How to prove there exists a linear transformation?
108035
solving diophantine equations using congruences
157213
Application of Luca's theorem
6410
Prove that $(ma, mb) = |m|(a, b)\ $ [GCD & LCM Distributive Law]
102204
Factoring product of two primes from solutions of congruence
23726
A closed form for $1^{2}-2^{2}+3^{2}-4^{2}+ \cdots + (-1)^{n-1}n^{2}$
78379
Proof on cubic residues
76347
Shorter proof for some equvalences
83776
Is there a direct proof of this lcm identity?
16700
Modular reduction of fractions
97196
$k^{\phi(l)} + l^{\phi(k)} \equiv1\pmod{lk}\,$ if $\,\gcd(l,k)=1$