PDF4PRO ⚡AMP

Modern search engine that looking for books and documents around the web

Example: bachelor of science

The Euclidean Algorithm and Multiplicative Inverses

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.

Theorem 2 (Multiplicative Inverse Algorithm). Given two integers 0 < b < a, consider the Euclidean Algorithm equations which yield gcd(a,b) = rj. Rewrite all of these equations ... so that (the residue of) y is the multiplicative inverse of b, mod a. Examples! Example 2. Find integers x and y to satisfy 42823x +6409y = 17.

Loading..

Tags:

  Residues, Theorem

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Spam in document Broken preview Other abuse

Transcription of The Euclidean Algorithm and Multiplicative Inverses

Related search queries