Question

hcf of 272 and 148 by euclid division algorithm

Answer 1

the HCF would be 

HCF => 272 = 148 x 1 + 124
             148 = 124 x 1 + 24
             124 = 24 x 5 + 4 
              24 = 4 x 6 + 0 

HCF IS = 4

HOPE it helped :-)

Answer 2

4 is the HCF of 272 and 148 by Euclid division algorithm.

Given:

272 and 148

To find:

HCF of 272 and 148 by Euclid Division Algorithm.

Solution:

To find the largest number that can divide both 272 and 148.

Using the Euclid Division Algorithm  

a=bq+r

a, b, are positive integers  

q, r, are unique whole number where $0 \leq r<b$

In the formula “a” is known as the dividend, b is the divisor, q and r, are called quotient and remainder  

So let us use the method of Euclid Division Algorithm. We have:

$a=bq+r$

Applying, the Euclid Division Algorithm on 272 and 148.

We get,

$272 =(148 \times 1)+124$

The remainder is not zero, therefore using Euclid Division Algorithm again with new a and b i.e. 148 and 124 respectively.

$148=(124 \times 1)+24$

The remainder is not zero, therefore using Euclid Division Algorithm again with new a and b i.e. 124 and 24 respectively.

$124=(24 \times 5)+4$

The remainder is not zero, therefore using Euclid Division Algorithm again with new a and b i.e. 24 and 4 respectively.

$24=(4 \times 6)+0$

After this we finally get the remainder zero. The HCF (148, 272) = 4.