By using Euclid’s algorithm, find the largest number which divides 650 and 1170.
Answers
Answered by
137
1170=650×1+520 650=520×1+130 520=130×4+0 130 is the largest number that divides 1170 and 650
Answered by
72
Answer:for this you will have to find the HCF OF the two numbers as 1170 is greater here consider it as 'a' and 650 as 'b' a>b
1170 = 650*1+520
650 = 520*1+130
520 = 130*4+0
hence remainder here is 0 130 is HCF of 1170 and 650
Step-by-step explanation:
Similar questions