Question

find :g.c.d (120, 504, 882) using euclid's algorithm ​

Answer 1

Answer:

Step-by-step explanation:

Since, 882>504 > 120

882 = 504 * 1 + 278

504 = 278*1 + 226

278= 226*1 + 52

226 = 52*4 + 18

52=18*2 +16

18=16*1+2

16=2*8+0

so GCD (882 and 504) = 2

next

120 = 2*60 +0

so GCD (882 , 504,120 ) is 2

MARK AS BRAINLIEST