Question:
By using Euclid's algorithm, find the largest number which divides 650 and 1170.
Solution:
650 and 1170
650 < 1170
Thus, we divide 1170 by 650 by using Euclid's division lemma
1170 = 650 × 1 + 520
∵ Remainder is not zero,
∴ we divide 650 by 520 by using Euclid's division lemma
650 = 520 × 1 + 130
∵ Remainder is not zero,
∴ we divide 520 by 130 by using Euclid's division lemma
520 = 130 × 4 + 0
Since, Remainder is zero,
Therefore, HCF of 650 and 1170 is 130.
Hence, the largest number which divides 650 and 1170 is 130.