Question

using Euclidean algorithm find GCD(1071,462)

Answer 1

1071 = 462*2+147
462 = 147*3+21
147 = 21*7+0
so the answer is 21

Answer 2

\[\begin{array}{rcl}
1071&=&2\times\color{blue}{462}&+&\color{green}{147}\\
\color{blue}{462}&=&3\times\color{green}{147}&+&\color{red}{21}\\
\color{green}{147}&=&7\times\color{red}{21}&+&0
\end{array}\]Therefore GCD(1071,462) is 21

Answer 3

so you do that process until you get 0 as a remainder then the answer is the last remainder you were given

Answer 4

very pretty

Answer 5

and now you can find the LCM very easy as well:)

Answer 6

http://staff.www.ltu.se/~larserik/applmath/chap10en/eq303.gif

Answer 7

@sherahhhh what do you not understand? :)