Transcription of The Euclidean Algorithm and Multiplicative Inverses
{{id}} {{{paragraph}}}
1 The Euclidean Algorithm and Multiplicative InversesLecture notes for Access 2011 The Euclidean Algorithm is a set of instructions for finding the greatest common divisorof any two positive integers. Its original importance was probably as a tool in constructionand measurement; the algebraic problem of findinggcd(a, b) is equivalent to the followinggeometric measuring problem: Given two different rulers, say of lengthsaandb, find athird ruler which is as long as possible, but so that you can still use it as a scale on bothof the longer rulers. There s a neat movie demonstration of how the Algorithm worksgeometrically, on theWikipediapage for Euclidean Algorithm .
The Euclidean Algorithm and Multiplicative Inverses Lecture notes for Access 2011 The Euclidean Algorithm is a set of instructions for finding the greatest common divisor of any two positive integers. Its original importance was probably as a tool in construction and measurement; the algebraic problem of finding gcd(a,b) is equivalent to the ...
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}