Recommended References
No video available for this topic. Explore these curated study references:
1 / 3
article
ocw.mit.edu
18.200 (S24), Lecture 15: Modular Arithmetic and Elementary ...
Explore this reference material for in-depth technical documentation and background theory on Divisibility and Prime Numbers.
Source: ocw.mit.eduRead Reference
Divisibility and Prime Numbers
Learning Objectives
- •Euclidean algorithm and gcd
- •Fundamental theorem of arithmetic
- •Prime distribution basics (π(x) asymptotics)
Weekly Outcome
By the end of this module you will be able to analyze divisibility, modular arithmetic, and apply discrete probability models, and correctly interpret p‑values in hypothesis testing.
Resources
18.200 (S24), Lecture 15: Modular Arithmetic and Elementary ...Number Theory Notes: Modular Arithmetic & Divisibility ...Lecture 10: Modular Arithmetic - YouTubeSpring 2024 Course Notes Note 6 1 Modular Arithmetic - EECS 70CS 70 Discrete Mathematics and Probability Theory Summer 2026 ...Discrete Math 2026: Modular Arithmetic Lecture Notes - StudocuModule 10.2: The Basics of Modular Arithmetic - Discrete Math Hub