|Home | Math | Genetics | Bridge | Spreadsheets | Workshops | Feedback|
Euclid's Algorithm for GCD
Euclid's algorithm for finding the greatest common divisor (GCD) of two numbers is often used to promote understanding of the quotient-remainder theorem. The user enters two integers and the spreadsheet shows each step of the algorithm. These sort of recursive algorithms are often difficult for students to visualize without see all the steps.
Detailed User Instructions
Load Euclid's GCD
(file size: 15KB)