Question

Find the GCD using the Euclidean Algorithm of the following I. GCD (1128, 555) II. GCD (28, 16) III. GCD (10256, 2999)

Answer 1

Answer:

1)

1128=555*2+18

555=18*30+15

18=15*1+3

15=3*5+0

gcd =3

2)

28=16*1+12

16=12*1+4

12=4*3+0

gcd= 4

rest all will be done by same manner.

Step-by-step explanation:

give good rating if it is helpful to you.