Modular Arithmetic | Road to RSA Encryption #6

This is the sixth 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-...

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 modular arithmetic. We discuss the introductory properties of modular arithmetic, show how to reduce large powers of a given number by a given modulus, and give a proof of the rule for divisibility by 9 using modular arithmetic.

#ModularArithmetic #ModularArithmeticRules #DivisibilityBy9

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!