Question

Use Euclid algorithm to find HCF of 272 and 1032 express the HCF in the form of 272m+1032n

Answer 1

Answer is in attachment

thank you

Answer 2

The HCF of 272 and 1032 is 27.

Step-by-step explanation:

Given : Numbers 272 and 1032 .

To find : The HCF of numbers by Euclidean division ?

Solution :

According to Euclidean division,

$\text{Dividend}=\text{Quotient}\times \text{Divisor}+\text{Remainder}$

When remainder became zero them quotient is the HCF.

$1032=272\times 3+216$

$272=216\times 1+56$

$216=56\times 3+48$

$56=48\times 1+8$

$48=8\times 6+0$

Remainder is zero.

The HCF of 272 and 1032 is 8.

#Learn more

Hcf of 54, 162 and 189

https://brainly.in/question/4267401