Question

find the value of b=7 and a=62 by euclids algorithm​

Answer 1

Answer:

GCD(62,7)  = 2

Step-by-step explanation:

A=62 , B=7

A ≠ 0

B ≠ 0

Use long division to find that 62/7 = 8 with a remainder of 6.

We can write this as:

62 = 7 * 8 + 6

Find GCD(8,6),  since GCD(62,7) = GCD(8,6)

A = 8, B = 6

A ≠0

B ≠0

Use long division to find that 8/6 = 1 with a remainder of 2.

We can write this as:

8 = 6 * 1 + 2

Find GCD(1,2),  since GCD(8,6) = GCD(1,2)

A =2 , B =1

A ≠0

B ≠0

Use long division to find that 2/1 = 2 with a remainder of 0.

We can write this as:

2 = 1 * 2 + 0

A ≠0

B ≠0

GCD(2,0) = 2

GCD(62,7) = GCD(8,6) = GCD(1,2) = GCD(2,0) = 2

⇒GCD(62,7)  = 2