Question

By using Euclids algorithm find the largest number which divides 650 and 1170,​

Answer 1

Answer:

1170 = 650*1+520

650 = 520*1+130

520 = 130*4+0

hence remainder here is 0 130 is HCF of 1170 and 650

Answer 2

Answer:

Your answer is 130.

Mark this as brainlist.