use Euclid division algorithm to find if the pair of numbers is co prime 121, 573
Answers
Answered by
3
Answer:
here is your answer
Step-by-step explanation:
using euclids divison algorithm,
a=bq+r ( 0is greater or eual to r <b )
here A=573 b = 121
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 , 1 is the answer
Similar questions