From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by imported>Bawolff 04:25, 9 April 2025 . The present address (URL) is a permanent link to this version. Revision as of 04:25, 9 April 2025 by imported>Bawolff (diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation
Jump to search
Compute the Euclidean algorithm step by step
a = 1071 ; b = 462 a = 119 ; b = 61
-1
0 × 0 q0 = 0 = r0 = 0 the algorithm is finished. Thus GCD( 1 × 1 q1 = 1 = r1 = 0 the algorithm is finished. Thus GCD( 2 × 2 q2 = 2 = r2 = 0 the algorithm is finished. Thus GCD( 3 × 3 q3 = 3 = r3 = 0 the algorithm is finished. Thus GCD( 4 × 4 q4 = 4 = r4 = 0 the algorithm is finished. Thus GCD( 5 × 5 q5 = 5 = r5 = 0 the algorithm is finished. Thus GCD( 6 × 6 q6 = 6 = r6 = 0 the algorithm is finished. Thus GCD( 7 × 7 q7 = 7 = r7 = 0 the algorithm is finished. Thus GCD( 8 × 8 q8 = 8 = r8 = 0 the algorithm is finished. Thus GCD( 9 × 9 q9 = 9 = r9 = 0 the algorithm is finished. Thus GCD( 10 × 10 q10 = 10 = r10 = 0 the algorithm is finished. Thus GCD( Number is too big for the calculator
Restart Start
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.
