Jump to content

User:Bawolff/euclidean

From Wikipedia, the free encyclopedia

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

= q0 × + r0
q0 =  ; r0 =
Since r0=0 the algorithm is finished. Thus GCD( , ) = .


= q1 × + r1

q1 =  ; r1 =
Since r1=0 the algorithm is finished. Thus GCD( , ) = .


= q2 × + r2

q2 =  ; r2 =
Since r2=0 the algorithm is finished. Thus GCD( , ) = .


= q3 × + r3

q3 =  ; r3 =
Since r3=0 the algorithm is finished. Thus GCD( , ) = .


= q4 × + r4

q4 =  ; r4 =
Since r4=0 the algorithm is finished. Thus GCD( , ) = .


= q5 × + r5

q5 =  ; r5 =
Since r5=0 the algorithm is finished. Thus GCD( , ) = .


= q6 × + r6

q6 =  ; r6 =
Since r6=0 the algorithm is finished. Thus GCD( , ) = .


= q7 × + r7

q7 =  ; r7 =
Since r7=0 the algorithm is finished. Thus GCD( , ) = .


= q8 × + r8

q8 =  ; r8 =
Since r8=0 the algorithm is finished. Thus GCD( , ) = .


= q9 × + r9

q9 =  ; r9 =
Since r9=0 the algorithm is finished. Thus GCD( , ) = .


= q10 × + r10

q10 =  ; r10 =
Since r10=0 the algorithm is finished. Thus GCD( , ) = .

Number is too big for the calculator Start

Restart Next →