Question

Use Euclid division algorithm Find HCF 273,1032

Answer 1

Step-by-step explanation:

i hope it will be helpful for you!!!

Answer 2

Answer:

The divisor 3 is the greatest common factor.

Step-by-step explanation:

The Euclid division algorithm of 273,1032  is done in figure -1

Steps to Solve:

First, divide the larger number by the smaller number

1032÷273=3 remainder 213

Divide 273 by 213

273÷213=1 remainder 60

Divide 213 by 60

213÷60=3 remainder 33

Divide 60 by 33

60÷33=1 remainder 27

Divide 33 by 27

33÷27=1 remainder 6

Divide 27 by 6

27÷6=4 remainder 3

Divide 6 by 3

6÷3=2 remainder 0

Since the remainder is 0, the divisor 3 is the greatest common factor.