The Euclidean algorithm finds the greatest common divisor of two integers. In upper elementary grades, it reinforces students' understanding of factors and the relationships between division and subtraction, but its applications continue into advanced mathematics. High school students can extend this algorithm to find the greatest common divisor of polynomials.

Presentation Format: General Interest / All Audiences Burst
Grade Band Audience: General Interest/All Audiences