The Euclidean algorithm for computing greatest common divisors, described in Euclid's Elements, is an iterative algorithm where you repeatedly subtract numbers until reaching nothing, and it is one of the earliest formally described algorithms in history.
factualpending
Speaker
Stephen WolframEvidence Quote
“the Euclidean algorithm for working out GCDs... is sort of described in Euclid um is an algorithm of that type where you keep on subtracting numbers and so on and until until you get down to there being nothing left.”
Created: 8/11/2026, 1:05:14 AM
Your notes
Loading notes...