Question

find GCD of (2740,1760) using euclid algorithm ​

Answer 1

hope it help mark me brilliant plz

Answer 2

Answer:

20 is the GCD of (2740,1760)

Step-by-step explanation:

Euclidean algorithm for GCD

GCD (a , b)   ;  a ≥ b > 0

a =  2740

b = 1760

Euclid's formula;

A = b(q) + r ; [q = quotient and r = remainder]

2740 = 1760 (1) + 980

again by taking a = 1760 and b = 980

1760 = 980 (1) + 780

similarly, we have to continue till we get r as 0

980 = 780(1) + 200

780 = 200 (3) + 180

200 = 180(1) + 20

180 = 20 (9) + 0

Now as the r = 0 ,

∴ 20 is the GCD of (2740,1760)