Math, asked by Oliver143, 1 year ago

Use Euclid division algorithm to find if the following pair of number is co prime 121,573

Answers

Answered by fusion
149
Using Euclid's division lemma, a=bq+r
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
 So, HCF of 573 and 121 is 1.
 Hence, 121 and 573 are co-prime.
Answered by adith244pbxpqz
45

Answer:

Using Euclid's division lemma, a=bq+r

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

 So, HCF of 573 and 121 is 1.

 Hence, 121 and 573 are co-prime


Similar questions