Question

Find the g.c.d of (1701,3768)​

Answer 1

Answer:

Therefore, the gcd of 1701 and 3768 is the last non-zero remainder, which is 3. So gcd(1701, 3768) = 3.

Step-by-step explanation:

We can find the greatest common divisor (gcd) of two numbers using the Euclidean algorithm, which involves repeatedly dividing the larger number by the smaller number and taking the remainder until we obtain a remainder of zero.

3768 = 2 × 1701 + 366

1701 = 4 × 366 + 225

366 = 1 × 225 + 141

225 = 1 × 141 + 84

141 = 1 × 84 + 57

84 = 1 × 57 + 27

57 = 2 × 27 + 3

27 = 9 × 3 + 0

Therefore, the gcd of 1701 and 3768 is the last non-zero remainder, which is 3. So gcd(1701, 3768) = 3.

TO know more about Find the g.c.d refer:

https://brainly.in/question/5103233

https://brainly.in/question/5103280

#SPJ1