Question

using euclid division lemma find the HCF of 92690, 7378, 7161,

Answer 1

First we apply Euclid's division algorithm on 92690 and 7378

We know algorithm

a= bq + r where 0≤ r < b And a > b

​So here

a = 92690 And b = 7378 , So

92690 = 7378 × 13 + 4154

7378 = 4154 × 1 + 3224

4154 = 3224 × 1 + 930

3224 = 930 × 3 + 434

934 = 434 × 2 + 62

434 = 62 × 7 + 0

Here r = 0 So H.C.F. of ​92690 and 7378 is 62

Now apply Euclid division algorithm on 62 and 7161

Here a = 7161 and b = 62 ,So

7161 = 62 ​× 115 + 31

62 = 31 ​× 2 + 0

Here r = 0 , So h.C.F. of ​62 and 7161 is 31 .

Hence H.C.F. of ​​92690 , 7378 ​and 7161 is = 31 ( Ans )