Quadratic Congruence with Composite Modulus 93

Описание к видео Quadratic Congruence with Composite Modulus 93

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 7x^2+15x=-8 for mod 93.
93 = 31*3 in prime factorization

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

Комментарии

Информация по комментариям в разработке