Question

by using Euclid algorithm find the largest number which divides 650 and 1170

Answer 1

Largest number which divides 650 and 1170 is equal to HCF of 650 and 1170.
So HCF of 650 and 1170 is 130.
So 130 is the largest number which divides 650 and 1170