Question

using euclids division algorithm.find whether 441 and 567 are co prime​

Answer 1

Step-by-step explanation:

Given  

using euclids division algorithm.find whether 441 and 567 are co prime

Two numbers whose hcf is 1 is known as co-prime numbers.

Using Euclid’s algorithm,

We get a = bq + r

567 = 441 x 1 + 126

441 = 126 x 3 + 63

126 = 63 x 2 + 0

So we get 63 as hcf.

To find hcf, so factors are

1. 441 = 3 x 3 x 7 x 7

2.  567 = 3 x 3 x 3 x 3 x 7

So hcf is 63

Now hcf is not 1 so the two numbers are not co-prime.

Alternate link to similar problem will be

https://brainly.in/question/1258958