Advertisements
Advertisements
Question
By using Euclid’s algorithm, find the largest number which divides 650 and 1170.
Numerical
Advertisements
Solution
Given: 650 and 1170.
Using Euclid’s division algorithm (division lemma).
1170 = 650 × 1 + 520
650 = 520 × 1 + 130
520 = 130 × 4 + 0
HCF (largest number dividing 650 and 1170) = 130.
shaalaa.com
Is there an error in this question or solution?
Chapter 1: Real Numbers - EXERCISE 1A [Page 9]
