Question

By using Euclid algorithm find the largest number which divides 650 and 1170

Answer 1

Answer:

the largest number is 130 which divides 650 and 1170.

Step-by-step explanation:

Firstly, we need to find the HCF of these two numbers (650,1170) by Euclidean Algorithm:

a=bq+r          (where 0≤r<b)

So, let us consider a=1170 and b=650, Now, let's start:

1170=650×1+520

650=520×1+130

520=130×4+0

As we see that, 130 is the HCF of (1170,650). So, the largest number is 130 which divides 650 and 1170.

_______________________________________________________

i hope it will helps you friend