Question

101592 and 8262 Euclid division algorithm. I want full answer

Answer 1

Answer:

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 is 101592,

Apply the division lemma to 101592 and $$8262$$,

101592=8262×12+2448

8262=2448×3+918

2448=918×2+612

918=612×1+306

612=306×2+0

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

Since the divisor at this stage is 306 .

∴HCF(101592,8262)=306