Template:Euclidean algorithm steps

Compute the Euclidean algorithm step by step

a = 1071; b = 462 a = 119; b = 61

-1

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

---

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

---

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

---

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

---

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

---

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

---

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

---

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

---

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

---

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

---

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

Restart Start

Template documentation[view] [edit] [history] [purge]

Usage

This template shows a step by step illustration of the Euclidean algorithm. It is meant to illustrate the Euclidean algorithm article.

This template depends on the Calculator gadget. If that gadget is not enabled, or js is not supported (e.g. when printing) the template is invisible.

The above documentation is transcluded from Template:Euclidean algorithm steps/doc. (edit | history)
Editors can experiment in this template's sandbox (create | mirror) and testcases (create) pages.
Add categories to the /doc subpage. Subpages of this template.