Template:Euclidean algorithm steps

Compute the Euclidean algorithm step by step:
a = 119; b = 61

$= q 0 \times + r 0$ $q 0 =; r 0 =$
Since $r 0 = 0$ the algorithm is finished. Thus $GCD(,) =$ .

= q 1 \times + r 1

$q 1 =; r 1 =$
Since $r 1 = 0$ the algorithm is finished. Thus $GCD(,) =$ .

= q 2 \times + r 2

$q 2 =; r 2 =$
Since $r 2 = 0$ the algorithm is finished. Thus $GCD(,) =$ .

= q 3 \times + r 3

$q 3 =; r 3 =$
Since $r 3 = 0$ the algorithm is finished. Thus $GCD(,) =$ .

= q 4 \times + r 4

$q 4 =; r 4 =$
Since $r 4 = 0$ the algorithm is finished. Thus $GCD(,) =$ .

= q 5 \times + r 5

$q 5 =; r 5 =$
Since $r 5 = 0$ the algorithm is finished. Thus $GCD(,) =$ .

= q 6 \times + r 6

$q 6 =; r 6 =$
Since $r 6 = 0$ the algorithm is finished. Thus $GCD(,) =$ .

= q 7 \times + r 7

$q 7 =; r 7 =$
Since $r 7 = 0$ the algorithm is finished. Thus $GCD(,) =$ .

= q 8 \times + r 8

$q 8 =; r 8 =$
Since $r 8 = 0$ the algorithm is finished. Thus $GCD(,) =$ .

= q 9 \times + r 9

$q 9 =; r 9 =$
Since $r 9 = 0$ the algorithm is finished. Thus $GCD(,) =$ .

= q 10 \times + r 10

$q 10 =; r 10 =$
Since $r 10 = 0$ the algorithm is finished. Thus $GCD(,) =$ .

Start

1