Question

using Euclid's division algorithm state whether the numbers 47 and 149 are co-primes or not​

Answer 1

Since 147 > 47 we apply Euclid's Division Lemma to 147 & 47

147÷47 leaves the remainder as 6

Since 47 > 6 we apply Euclid's Division Lemma to 47 & 6

47÷6 leaves the remainder as 5

Since 6 > 5 we apply Euclid's Division Lemma to 6 & 5

6÷5 leaves the remainder as 1

Therefore Greatest (highest) common factor (divisor) Of 47; 147 = 1;

They Coprime numbers (relatively prime) Thank You

Answer 2

Answer:

two natural number which don't have a common prime factor are called co-primes eg (34) , (16, 25) so, (47, 149) are coprimes