Visual GCD

This worksheet demonstrates a visual algorithm for computing the greatest common divisor of two numbers. At each step, we cut off the largest possible square from the top right corner, until the shape that remains is a square. The side length of the final square is the greatest common divisor of the side lengths. Can you see why this works? I would like to thank the participants on the GeoGebra forum for helpful discussions while I was developing this worksheet.

 

David Radcliffe

 
Resource Type
Activity
Tags
algebra  number_theory 
Target Group (Age)
15 – 18
Language
English (United Kingdom)
 
 
GeoGebra version
4.0
Views
9194
Report a problem
License
CC-BY-SA, GeoGebra Terms of Use
Derived Resources
최대공약수 구하기
Shared by mathcare
 
 
© 2018 International GeoGebra Institute