Linear Congruence Solving Using Euclid's Algorithm

0:00 Linear congruence solving using Euclid's algorithm

0:07 Computer science or engineering problem 17x congruent to 3 ( mod 29)

0:15 Method or to do sequence to solve the problem

1:07 Procedures for Euclid's algorithm

1:31 Back substitution

1:45 To do (stage 1) : Finding GCD ( 17, 29) using Euclid's algorithm and solution exist or not

2:37 To do (stage 2) : Checking for proceedings to next stage: if 1 divides 3

2:52 To do (stage 3A) : 1st part : Finding inverse of 17x congruent to 3 ( mod 29)

3:39 To do (stage 3A) : 2nd part : Back substitute

5:18 To do (stage 3B) : Generalising the solution

5:56 Let's conclude and QED

Feel free to explore the latex source:
www overleaf com /read /bpbxswfyjnrr

Subscribe please, it helps