Question

using
euclid Algorithu.m. Find HCF OG
240
anol 222,​

Answer 1

Step-by-step explanation:

Here 240 > 228 we always divide greater number with smaller one.

Divide 240 by 228 we get 1 quotient and 12 as remainder so that

Divide 228 by 12 we get 19 quotient and there is ‘no remainder’ so we can write  

As there are no remainder, 12 is the “H.C.F. of 240 and 222