Lecture 4: Number Theory I (MIT 6.042J)
by Tom Leighton, Marten van Dijk · MIT OpenCourseWare
Covers divisibility, greatest common divisors as linear combinations, Euclid's algorithm and the Pulverizer (extended Euclidean algorithm) for finding Bezout coefficients. A full lecture video from a 25-video discrete mathematics course with exams and solutions; afterwards you can run both algorithms by hand.
More resources on Divisibility
Wolfram MathWorld
MathWorld is an online mathematics encyclopedia from Wolfram Research offering detailed, browsable articles on topics across the math spectrum, including algebra, geometry, calculus, and number theory. Each entry includes definitions, theorems, formulas, diagrams, worked examples, and links to further reading.
Art of Problem Solving - Divisibility
Community-maintained Art of Problem Solving wiki page defining divisibility of integers and collecting the standard divisibility rules for small divisors, with links to related number theory articles and competition problems useful for MATHCOUNTS and AMC preparation.
Elementary Number Theory
Explore the beauty of numbers! This elementary number theory course covers divisibility, primes, congruences, and more.
Introduction to Number Theory (Art of Problem Solving)
Competition-oriented textbook moving from divisibility rules and prime factorization through GCD, LCM, base arithmetic and modular arithmetic. Each chapter teaches through worked contest problems with full solutions, aimed at MATHCOUNTS and AMC-level students.
Divisibility and Greatest Common Divisors (Keith Conrad)
Expository note from a UConn number theorist. Establishes the divisibility relation and its properties, then proves the two central theorems on greatest common divisors — Euclid's algorithm and Bezout's identity — with worked integer examples and careful notation.
Elementary Number Theory: Primes, Congruences, and Secrets
Springer Undergraduate Texts volume the author released free online with the publisher's permission. Treats primes, the Euclidean algorithm, unique factorization, congruences and quadratic reciprocity, then RSA and elliptic curves, with every computation worked in open-source Sage. Answers 'why does divisibility matter' by carrying factorization and gcd straight into RSA and elliptic curves, with runnable computations.