User:Bawolff/euclidean

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

= q₀ × + r₀
q₀ =  ; r₀ =
Since r₀=0 the algorithm is finished. Thus GCD( , ) = .

Restart Next →Next →

---

= q₁ × + r₁

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

Restart Next →Next →

---

= q₂ × + r₂

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

Restart Next →Next →

---

= q₃ × + r₃

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

Restart Next →Next →

---

= q₄ × + r₄

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

Restart Next →Next →

---

= q₅ × + r₅

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

Restart Next →Next →

---

= q₆ × + r₆

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

Restart Next →Next →

---

= q₇ × + r₇

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

Restart Next →Next →

---

= q₈ × + r₈

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

Restart Next →Next →

---

= q₉ × + r₉

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

Restart Next →Next →

---

= q₁₀ × + r₁₀

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

Restart Next →Next → Start

1