Question

by using Euclid's algorithm,find the largest number which divides 650 and 1170.​

Answer 1

Answer:

Hence 130 is the biggest number which divides 650 and 1170

Step-by-step explanation:

Using the Euclid's division lemma on 1170 and 650

then 1170=650+520

Using the Euclid's division lemma on 650 and 520

650=520+130

Using the Euclid's division lemma on 130 and 520

520=130*4+0

here we get remainder zero

So 130is HCF of 650 and 1170

Hence 130 is the biggest number which divides 650 and 1170

Answer 2

Answer:

130 is the biggest number which divides 650 and 1170

ʜᴏᴘᴇ ɪᴛ ʜᴇʟᴘꜱ ʏᴏᴜ. ☺❤