Question

find the HCF of 792 402 by Euclid Lemma algorithm​

Answer 1

$\huge\sf {Euclid's \:division\: lemma :-}$

Let a and b be any two positive Integers .

Then there exist two unique whole numbers q and r such that

a=bq+r ,

0≤r<b

Now ,

start with a larger integer , that is792

$\rm 792=402×1+390$

$\rm402=390×1+12$

$\rm390=12×32+12$

$\rm12=6×2+0$

The remainder has now become zero , so our procedure stops.

Since the divisor at this stage is 6.

∴HCF(792,402)=6