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 algorithm 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
▶︎
Fermat's Little Theorem examples
▶︎
Linear congruence example 2 | Number theory | Finding solution of x | Fully Solved Example Solution
▶︎
Modular Arithmetic Basics: Congruence mod n
▶︎
If Prime Numbers Become Increasingly Rare, Then Why Do They Keep Showing Up In Pairs?
▶︎
But what are Hamming codes? The origin of error correction
▶︎
Solving linear congruences -- Number Theory 10
▶︎
Solving Linear Congruences, Modular Arithmetic
▶︎
The Extended Euclidean algorithm
▶︎
The Differential Equations Explained Better Than School Ever Did
▶︎
Expand & Simplify a Linear expression with 2 brackets
▶︎
FIFA World Cup Uncut | 8 Minutes of Unforgettable Madness | Brazil vs Germany (2014 Semi-Final)
▶︎
Chinese Remainder Theorem
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
Animation vs. Geometry
▶︎
When Genius Teens Destroy Corrupt Cops
▶︎
System of congruences, modular arithmetic
▶︎
Last 2 digits using Euler's Totient Function
▶︎
Animation vs. Math
▶︎
The Greatest Mathematician of Our Time
▶︎