Question

using Euclidean algorithm find GCD(1071,462).

Answer 1

\(1071 = \color{red}{462}\times 2 + \color{green}{147} \)

Answer 2

next, check if the remainder 147 goes evenly in 462

Answer 3

\(462 = \color{red}{147}\times 3 + \color{green}{21} \)
no luck yet, continue next iteration wid 147 and 21

Answer 4

Wait

Answer 5

I saw that before

Answer 6

??

Answer 7

nvm

Answer 8

only that ? @ganeshie8

Answer 9

you need to continue till the remainder divides evenly
or in simple words : keep going until u get a 0 remainder.

Answer 10

\(1071 = \color{red}{462}\times 2 + \color{green}{147} \)
\(462 = \color{red}{147}\times 3 + \color{green}{21} \)
\(147 = \color{red}{21} \times 7 + \color{green}{0} \) <<<<<<<<

since 21 goes evenly in 147, 21 is the gcd(1071, 462)