Question

use euclids division algorithm to find the 121 and 573 are co prime

Answer 1

Euclids division algorithm
Dividend = divisor x quotient + remainder
573 = 121 x 4 + 89
121 = 89 x 1 + 32
89 = 32 x 2 + 25
32 = 25 x 1 + 7
25 = 7 x 3 + 4
4= 3 x 1 + 1
3 = 1 x 3 + 0
*** Co prime are the number which have only two factors that is number itself and 1
Therefore, their H. C. F = 1 means they are
co primes.