GCD and Modular Inverse: Extended Euclidean Algorithm - Part 1

preview_player
Показать описание
This video is the first part of a two-part video series that clearly explains the process of finding the greatest common divisor of two positive integers, and the inverse of a positive integer modulo another positive integer using the Extended Euclidean Algorithm. Please let me know your comments. Enjoy!!!
  1. Samuel Chukwuemeka
  2. modular arithmetic
  3. modular inverse
  4. modular algorithm
  5. euclidean algorithm
  6. extended euclidean algorithm
Рекомендации по теме
Extended Euclidean Algorithm 0:06:00

Extended Euclidean Algorithm and Inverse Modulo Tutorial

GCD and Modular 0:44:48

GCD and Modular Inverse: Extended Euclidean Algorithm - Part 1

How to compute 0:12:19

How to compute the modular inverse of a number

GCD, Bezout, and 0:22:21

GCD, Bezout, and Modular Inverses | The Extended Euclidean Algorithm

The Extended Euclidean 0:12:11

The Extended Euclidean algorithm

Extended Euclidean Algorithm 0:10:16

Extended Euclidean Algorithm (Solved Example 1)

GCD and Modular 0:37:06

GCD and Modular Inverse: Extended Euclidean Algorithm - Part 2

How To Find 0:10:58

How To Find The Inverse of a Number ( mod n ) - Inverses of Modular Arithmetic - Example

Extended Euclidean Algorithm 0:04:24

Extended Euclidean Algorithm using Example Multiplicative inverse of a number | Cryptography

Extended Euclidean Algorithm 0:14:50

Extended Euclidean Algorithm Example

Multiplicative Inverse 0:10:03

Multiplicative Inverse

CSS #15 Extended 0:13:01

CSS #15 Extended Euclidean Algorithm | GCD | Euclidean Algorithm | BTB | Multiplicative Inverse🔥

Modular Arithmetic and 0:13:58

Modular Arithmetic and the Extended Euclidean Algorithm- Discrete Math Structures Lesson 7

Use Excel to 0:21:30

Use Excel to find Modulo, GCD, and Modular Inverse

Asymmetric Cryptography, GCD, 0:27:28

Asymmetric Cryptography, GCD, Euclidean Algorithm, Extended Euclidean Algorithms, Modular inverses

Modular inverse made 0:04:12

Modular inverse made easy

Finding the Multiplicative 0:12:16

Finding the Multiplicative Inverse using Extended Euclidean Algorithm Example 1 HD

Extended Euclidean Algorithm 0:07:40

Extended Euclidean Algorithm - Example (Simplified)

How GCD and 0:06:33

How GCD and inverse are related?

Number Theory | 0:08:02

Number Theory | Inverses modulo n

Extended Euclidean Algorithm 0:11:10

Extended Euclidean Algorithm to find multiplicative inverse| C implementation

Extended Euclidean Algorithm 0:05:43

Extended Euclidean Algorithm (Solved Example 2)

3.3 – Finding 0:28:20

3.3 – Finding Modular Inverses

Extended Euclidean Algorithm 0:06:54

Extended Euclidean Algorithm (Solved Example 3)

Комментарии
Автор

VERY well explained. I may actually pass the test now. Thank you.

OCDTraci
Автор

Thanks.  I like the step-by-step explanation.

andrewpappas
Автор

You are very welcome, Syed. I understand your request. Usually, I do videos of the courses I teach at that time. Videos on "Crytography" would have to wait till the next time I teach Discrete Math or Analysis of Algorithms. I may also do so when I am done with the videos of the courses I am teaching at this time. Thank you..

SamuelChukwuemeka
Автор

Bonjour,

Pour le dernier exemple traité, le schéma d'OURAGH donnera





d'où il vient      141(-7)+19(52)=1    (pgcd(19;141)=1).

Cordialement.

ouraghyoussef
Автор

thanx very much i really like ur method sir.

shamsulawal
Автор

sir thanks for your lectures.
I wish I can meet you one on one.

emmysonalg