Linear Congruence cannot be solved

preview_player
Показать описание
Jay explains how to show that this linear congruence has no solutions
Рекомендации по теме
Комментарии
Автор

If you had chosen to look for solutions for
a = b (mod n), then with the same arguement you used in this video, you could show that
a = b (mod n) has a solution if and only if,
c | b, where c = gcd(a, n).

This being the case, then by a contrapositve argument, if gcd(a, n) ∤ b, then
a = b (mod n) has no solution.

davidbrisbane
Автор

Thanks for this video.. I am in searching of this proof

sreyasijana