Question

Use euclid's division algorithm to find the hcf of 92690, 7378 and 7161

Answer 1

Hii, dear friend....
here is Ur answer ..
if it's helpful for you hope U select my answer as brainlist ☺☺

Question is Find the H.C.F of 92690, 7378 and 7161

Sol ._____★____

By Euclid's division lemma on 92690 and 7378

for every point of integers A and B there exist unique integer q and r
such that a = bq + r

where 0≤ r < b
so here and a > b
a = 92690 and b = 7378 , so

=> 92690 = 7378 × 13 + 4154
=> 7378= 4154 × 1 + 3224
=> 4154 = 3224 × 1 + 930
=> 3224 = 930 × 3 + 434
=> 930 = 434 × 2 + 62
=> 434 = 62 × 7 + 0

Here, r= 0 so H.C.F of 92690 and 7378 is 62.

Now apply Euclid's division lemma on 62 and 7161

Here a = 7161 and b = 62 , so that a > b

=> 7161 = 62 × 115 + 31
=> 62 = 31 × 2 + 0

here r = 0, so H.C.F of 62 and 7161 is 31.

H.C.F OF 92690 , 7378 AND 7161 IS 31.

ANSWER IS 31.

THANKS☺