OurBigBook.comSite Source code

Euclidean algorithm

The Euclidean algorithm repeatedly replaces

(a, b)

by

(b, a mod b)

and terminates at

g cd (a, b)

.

Table of contents 63 2
- Linear Diophantine equation Euclidean algorithm 49 1
  - Linear Diophantine equation solvability criterion Linear Diophantine equation 31

 Ancestors (4)

 Incoming links (4)