Least Residue of a Quadratic Congruence Mod 21 

This video discusses how to solve a system of quadratic congruences for the variable x .
The question is x^2+7x-12=3 for modulus 21
We first solve mod 3 then mod 7
Then we find 4 solutions using the Chinese Remainder Theorem
This is a topic in Number Theory
• Hensel's Lemma lifting...
• Solve a Quadratic Cong...
#quadraticequations
#congruencia
#congruency
#congruencia
#congruencemodulo
#módulos
#módulo1
#módulo
#modulusclasses
#modulusfunction