Question

Using Euclid algorithms find the h.c.f of 240 and 288

Answer 1

Answer:

Step-by-step explanation:

The H.C.F. of ‘240 and 228’ by “Euclid division algorithm” is 12.

To find:

H.C.F. of 240 and 228

Solution:

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 288

Answer 2

Answer:

Step-by-step explanation:

Divide 288  by 240, and get the result 1 with remainder 48, so 288=1·240+48

Divide 240 by 48, and get the result 5 with remainder 0, so 240=5·48+0.

Since the remainder is 0 , process stops here.

The greatest common divisor of 288 and 240 is 48.