Question

. Use Euclid’s Division Algorithm to find whether the pair of numbers are coprime or not?

b) 1305,1530
​

Answer 1

It’s convenient to first find the greatest common divisor (which is a more common term among mathematicians than highest common factor) of the two smaller numbers:

1305= 60⋅21+45

60=45⋅1+15

45=15⋅3+0

Thus the greatest common divisor is 15 . Now we can check with the third number:

1530=15⋅102+0