By using Euclid's algorithm, find the largest number which divides 650 and 1170...
Plz don't spam it .....
Help me .....
Answers
Answered by
2
Answer:
by Euclid's division lemma,we have
a=bq+r ;0 is less than or equal to r but less than b
1170=650×1+520
650=520×1+130
520=130×4+0
HCF= 130
Similar questions