Question

use Euclid's divisuon algorithm to find HCF OF 8262 AND 101592

Answer 1

Answer:

306

Step-by-step explanation:

We know that Euclid's division Lemma is x and y for any two positive integers, there exist unique integers q and r satisfactorily x = yq + r, where 0 ≤ r <y. In case r=0 then y will be the HCF. Here we see 101592> 8262

Now,

101592= 8262×12+2448

8262=2448×3+918

2448=918×2+612

918=612×1+306

612=306×2+0

Hence, finally we have found the remainder (r)= 0

So, HCF (101592,8262)= 306

The answer is 306

Answer 2

Answer:

306 is the right Answer

please Mark me as brainlist