Quadratic Congruence with Composite Modulus

This video discusses how to solve a system of quadratic congruences for the variable x. but when the modulus is not a prime number. So, the modulus is compound number so take the prime factorization and split the equation into a combination of each of the solutions for each of the prime factors. There is normally 2 per mod prime factor but this is not always the case.
We use the Chinese remainder theorem to solve each combination of the congruences.
This is a topic in Number Theory
The question is x^2-4x+3=0 for mod 35.

#quadraticequations
#congruencia
#congruency
#congruencia
#congruencemodulo
#módulos
#módulo1
#módulo
#modulusclasses
#modulusfunction