Question

Using Euclid division algorithm find hcf of 248,220

Answer 1

euclids divison lemma

between any two postive integers a and b their exists a unique whole number q and r such that

a=bq+r where 0<r<b

solution

step-1

248=220*1+28

step-2 ,where r is not equal to 0

220=28*7+24

step-3 , where r not equal to 0

28=24*1+4

step-4,where r is 0

24=4*6+0

here remainder is 0 so HCF is 4

hence HCF of 220,248 is 4

for seeing the full divison refer to the attachment

Answer 2

Step-by-step explanation:

using Euclid division algorithm find hcf of 248 and 220

Solution :

Using Euclid's Division Lemma of finding HCF :

Given Numbers = 248, 220

As 248 is greater number so doing factors of 248 in the form of 220 :

248 = 220 × 1 + 28

220 = 28 × 7 + 24

28 = 24 × 1 + 4

24 = 4 × 6 + 0

24 = 24

HCF = 4 ( Ans )