Use the Chinese remainder theorem to solve the system of linear congruence:
133925
Find All Solutions to System of Congruence
360
Modular exponentiation by hand ($a^b\bmod c$)
45882
Solving a congruence without Fermat's little theorem
93820
Fermat's little theorem applied for $n$'th root existence $\!\bmod p$
80754
A slight modification in Chinese Remainder Theorem
141704
Fractional exponentiation in modular arithmetic
96095
If $\{a_1,\dots,a_{\phi(n)}\}$ is a reduced residue system, what is $a_1\cdots a_{\phi(n)}$ congruent to?
130162
A complete residue system from an arithmetic progression
19071
solution set for congruence $x^2 \equiv 1 \mod m$
61825
Congruence class $[a]$ modulo $m$, $\gcd(x, m) = \gcd(a, m)$
152506
The greatest common divisor is the smallest positive linear combination
325
If every pair of congruence equations admits solutions, then the entire system admits solutions
145617
Is there any simple trick to solve the congruence $a^{24}\equiv6a+2\pmod{13}$?
150446
Quadratic Modular Arithmetic
50249
Pairs of numbers with a given LCM
56528
On the proof of existence and uniqueness of radix representation
95533
I need some help with a GCD and LCM's Problem