EngageNY
The Euclidean Algorithm as an Application of the Long Division Algorithm
Individuals learn to apply the Euclidean algorithm to find the greatest common factor of two numbers. Additionally, the lesson plan connects greatest common factor to the largest square that can be drawn in a rectangle.
Curated OER
Euclidean Algorithm
Young scholars are introduced to the concept of a Greatest Common Divisor. They review the number systems. Students are told how the entire field of Number Theory primarily uses the integers. They are told the Fundamental Theorem of...