Question

find hcf 144,610 by euclid division algorithm​

Answer 1

Answer:

$hey dear$

Hey dear!

Here is yr answer

GCD 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 GCD

Hence, 2 is the greatest common divisor(GCD) of 144 & 610

[tex]hope it's helpful for you[/tex]

Answer 2

Answer:

hey dear ...

above given ....

2 is HCF of 144, 610