Question

Find HCF (144, 610) using Euclid's division algorithm​

Answer 1

$\huge{\fbox{\fbox{\mathrm{\blue{Answer}}}}}$

HCF of 144 and 610

610 > 144

a = bq + r (0 ≤r <b)

610 = 144 × 4 + 34

144 = 34 × 4 + 8

34 = 8 × 4 + 2

8 = 2 × 4 + 0

Here, r = 0

Therefore, Divisor is the HCF

Hence, 2 is the Highest Common Factor (HCF) of (144 ,610)

Answer 2

Answer:

★HCF (144,610) = 3 ★

Step-by-step explanation:

To Find:

• Find HCF of (144,610) using Euclid's division algorithm

Solution: As 610 > 144 therefore

a = bq + r ( 0 ≤ r <b )

$\small\implies{\sf }$ 610 = 144 x 4 + 34

$\small\implies{\sf }$ 144 = 34 x 4 + 8

$\small\implies{\sf }$ 34 = 8 x 4 + 2

$\small\implies{\sf }$ 8 = 4 x 2 + 0

Here, r = 0

Therefore, HCF of (144 and 610) will be 2