How to know when it's possible to solve a modular equation?
2904
Solving linear congruence (modular inverse or fraction) via gcd Bezout equation
51153
Number of solutions to $x^2\equiv a\pmod m$
80875
Congruence equation ...
102204
Factoring product of two primes from solutions of congruence
112390
Solutions of $x^2 \equiv 1 \pmod N$
38727
Modular Exponentiation and Primes
21530
How many solutions of $\mod 63$ : $x^2=1 \pmod7 $ and $x^3=1\pmod 9$
151636
Fast way to calculate n! mod m where m is prime?
119433
How to find modulo of large numbers like $9801\! \pmod {\!32}$
56170
Solve a complex equation symbolically?
68235
Is there a way to solve for an unknown in a factorial?
158684
How to solve and see resolution of $13^{53} \pmod 7$ using Fermat little Theorem?
143754
Finding the solution of the congruence $4x\equiv16\pmod{26}$
29204
$a\equiv\bar a\!\pmod{\!kn}\Rightarrow a\equiv\bar a\!\pmod{\! n};\ $ $(a\bmod kn)\bmod n=a\bmod n.\ $ Congruences persist mod factors of the modulus
40087
Using Modularity Theorem and Ribet's Theorem to disprove existence of rational solutions
39800
Existence of solution for a linear system mod 2
41890
How to get all solutions of $x^2 \equiv$ $a$ mod $p$?