@openstem shared this note
Mathematics · L3 · Number Theory: GCD, LCM & the Euclidean Algorithm
The Euclidean algorithm as a fast way to compute the GCD by repeated division, the GCD-LCM product relationship, and coprime numbers.
Mathematics
Updated 0
0
Read only
More in Mathematics
Browse Mathematics- Mathematics · L2 · Percent Applications: Discount, Tax & Tipnote
- Mathematics · L2 · Two-Way Tables & Venn Diagramsnote
- Mathematics · L4 · Solving first-order differential equationsnote
- Mathematics · L5 · Convex Optimization: Convexity, Duality, and KKT Conditionsnote
- Mathematics · L3 · The Pythagorean Theorem & Coordinate Geometrynote
- Mathematics · L2 · Exponents & Square Rootsnote