Math, asked by 9970806248, 1 year ago

Using euclids division algorithm find the HCF of 240 and 228 step wise

Answers

Answered by Anonymous
5
Hello friend

Good afternoon

❗❗❗❗❗❗❗❗❗❗❗❗❗

Your answer is given below you can check it

We know Euclid's division lemma

=> a = b q + r

Here 240 > 228

So AT euclid's Division lemma

240 = 228 x 1 + 12

228 = 12 x 19 + 0

Here remainder is 0

So the answer is 12

❗❗❗❗❗❗❗❗❗❗❗❗❗

I hope it will help you

Thanks
Answered by Ishu307
10
euclids division algorithem

240 =228×1+12
228 =12×19+0

mark my answer brainliest if it helped you......plz
Attachments:
Similar questions