Question

find the hcf of 60 and 80 using euclid's algorithm​

Answer 1

HCF ( 80 , 60 ) = 20

80 >60

80 = 60×1 +20

60 = 20×3+0

The remainder has now become zero, so our procedure now stops.since the divisor at this stage is 20,the hcf of 80 and 60 is 20.

Answer 2

Given,

Number 1 = 60

Number 2 = 80

To Find,

The HCF of the given numbers  =?

Solution,

As we can see 60 < 80, using Euclid’s division we get,

80 = 60*1 + 20

The remainder 20 ≠ 0 , therefore applying Euclid’s division again

60 = 20 * 4 + 0

The remainder is equal to 0. The iteration stops at the second step.

The HCF = The divisor at the last stage

The HCF = 20

Hence, the HCF of 60 and 80 using Euclid's algorithm​ is 20.