Coursera Plus Annual is 40% Off — Ends June 29.

Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

MIT OpenCourseWare

Divisibility - Number Theory and Applications Through GCD and Extended Euclidean Algorithm - Lecture 8

MIT OpenCourseWare via YouTube

Start learning Write review
CodeSignal Ad

Learn Generative AI, Prompt Engineering, and LLMs for Free

Learn More → Train in Data Ad

Master Production-Ready Machine Learning, Step by Step

Learn More →

Overview

AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Explore number theory fundamentals through the mathematical concepts of divisibility, greatest common divisor (GCD), and the Extended Euclidean Algorithm in this 79-minute lecture from MIT's Mathematics for Computer Science course. Learn how these foundational number theory principles apply to computer science applications while examining divisibility properties, understanding how to find the greatest common divisor of two numbers, and mastering the Extended Euclidean Algorithm for solving linear Diophantine equations. Discover the theoretical underpinnings that support many computational algorithms and cryptographic systems through clear mathematical explanations and practical examples. Gain essential mathematical tools used in algorithm design, complexity analysis, and discrete mathematics that form the backbone of computer science theory.

Syllabus

Lecture 8: Divisibility

Taught by

MIT OpenCourseWare

Tags

Reviews

Start your review of Divisibility - Number Theory and Applications Through GCD and Extended Euclidean Algorithm - Lecture 8

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.