Solve a Linear Congruence using Euclid's Algorithm

Описание к видео Solve a Linear Congruence using Euclid's Algorithm

How to solve 17x ≡ 3 (mod 29) using Euclid's Algorithm. If you want to see how Bézout's Identity works, see    • Bézout's Identity, using Euclid's alg...  

0:00 A linear congruence...
0:30 ....is not an equation, but...
1:18 Multiplicative inverse
4:40 Euclid's Algorithm
5:58 Make the remainder the subject in each line
7:10 Backwards substitution
12:20 Multiply both sides of congruence by the multiplicative inverse
13:20 Check

Комментарии

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