Find G.C.D of 144 and 610, by using Euclid's algorithm
Answers
Answered by
26
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
Hope it helps..
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
Hope it helps..
Answered by
8
Answer:
Step-by-step explanation:
Attachments:
Similar questions