Prime Numbers | Road to RSA Encryption #5

This is the fifth 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: https://www.amazon.com/Number-Theory-... 4:44 Fundamental Theorem of Arithmetic 13:11 Great Common Divisors 17:09 Euclid's Proof of Infinitude of Primes 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 prime numbers. We establish the Fundamental Theorem of Arithmetic, namely that any positive integer can be written as a product of primes. We then look at how primes can give us access to greatest common divisors, and then we present Euclid's proof of the infinitude of primes. #PrimeNumbers #FundamentalTheoremOfArithmetic #EuclidPrimes CHECK OUT OTHER TYPES OF VIDEOS: ================================ GRE Math Subject Test:    • Improve Your Math Subject GRE Score   Putnam Math Competition:    • Putnam Math Competition | Improve Your Put...   Math Theorem Corner:    • Math Theorems | Learn New Math Theorems   Math Problems Corner:    • Problem Solving Strategies   Math Insights:    • Learn New Math Techniques!   Academic Advice:    • Academic Advice for Undergrads   GET MY BOOK ON AMAZON!! ======================== "Number Theory Towards RSA Cryptography in 10 Undergraduate Lectures" https://www.amazon.com/Number-Theory-... CHECK ME OUT ON THE INTERNET!! ============================== TikTok: @profomarmath Website: www.mohamedomar.org Twitter: @ProfOmarMath Instagram: profomarmath YouTube:    / profomarmath   And of course, subscribe to my channel!