Question

by using euclids algorithm find the largest nos wgich divides 650 ad 1170

Answer 1

for this u need to find had of this number
1170=650×1+520
650=520×1+130
520=130×4+0
so 130 is your answer.

Answer 2

HERE YOU GO:
•THE LARGEST NUMBER WILL BE HCF OF 1170 AND 650...

1170 = 650*1+520
650 = 520*1+130
520 = 130*4+0
Hence 130 is the largest number which divides 650 and 1170.
HOPE IT HELPS..