Euclidian Algorithm

An extremely efficient algorithm for getting the GCD (greatest common divisor). In idea of Set Theory:

Theorem 8.4.5 in words:
$GCD(a,b)=as+bt$, where $s$ and $t$ are integers.