Abstract
In The bequest of the Greeks Tobias Dantzig illustrates the Euclidean division algorithm using squares and rectangles. Although he dwells on the continued fraction expansion for a/b, where a and b are relatively prime, it is only a small step to use the Greek imagery of representing numbers by geometric figures for illustrating the algorithm in finding gcd(a,b), the greatest common divisor (or highest common factor) of two numbers a and b. Indeed, this geometric line of thinking leads to an easily programmable algorithm for directly finding lcm(a,b), the least common multiple of a and b, without first finding gcd(a,b).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
