This is the second video in a series of videos that leads up to the math of RSA Cryptography. This video series will cover the contents of the book "Number Theory Towards RSA Cryptography in 10 Undergraduate Lectures" available here:

[ Ссылка ]

This content is covered in a Discrete Math course I often teach, and is usually covered in a stand alone Number Theory course at other institutions.

In this video we cover Bezout's Lemma and a characterization of the GCD in terms of integer combinations. We will use this to prove an interesting divisibility property and end with a surprise bonus feature.

#EuclideanAlgorithm #GreatestCommonDivisor #GreatestCommonFactor

CHECK OUT OTHER TYPES OF VIDEOS:
================================

GRE Math Subject Test: [ Ссылка ]

Putnam Math Competition: [ Ссылка ]

Math Theorem Corner: [ Ссылка ]

Math Problems Corner: [ Ссылка ]

Math Insights: [ Ссылка ]

Academic Advice: [ Ссылка ]


GET MY BOOK ON AMAZON!!
========================

"Number Theory Towards RSA Cryptography in 10 Undergraduate Lectures"

[ Ссылка ]

CHECK ME OUT ON THE INTERNET!!
==============================

TikTok: @profomarmath
Website: www.mohamedomar.org
Twitter: @ProfOmarMath
Instagram: profomarmath
YouTube: www.youtube.com/ProfOmarMath

And of course, subscribe to my channel!

свернуть