Question

use euclids division algorithm to find if the following pair of numbers is co primes 121 and 573​

Answer 1

$\Large{\textbf{\underline{\underline{According\:to\:the\:Question}}}}$

Here we have to use Euclid division Algorithm

Hence we have,

a = bq + r

As after applying :-

573 = 121 × 4 + 89

121 = 89 × 1 + 32

89 = 32 × 2 + 25

32 = 25 × 1 + 7

25 = 7 × 3 + 4

7 = 4 × 1 + 3

4 = 3 × 1 + 1

3 = 1 × 3 + 0

Hence we get,

HCF = 1

HCF (573 , 121) = 1

Therefore we get that,

121 and 573 are co-prime

${\boxed{\sf\:{Additional\; Information}}}$

In case :-

★Three positive integers a,b,c

★HCF(a,b,c) × LCM(a,b,c) ≠ a × b × c

$\tt{\rightarrow LCM(a,b,c)=\dfrac{a\times b\times c\times HCF (a,b,c)}{HCF(a,b)\times HCF(b,c)\times HCF(a,c)}}$

$\tt{\rightarrow HCF(a,b,c) =\dfrac{a\times b\times c\times LCM (a,b,c)}{LCM(a,b)\times LCM(b,c)\times LCM(a,c)}}$