Question

by using euclids division algorithm find the largest number which divides 650 and 1170​

Answer 1

Answer:

10 is the hcf of 650 and 1170

Step-by-step explanation:

1170=650×1+480

650=480×1+170

480=170×2+140

170=140×1+30

140=30×4+20

30=20×1+10

20=10×2+0