Question

Find the GCD of -4000, -2000, 0, 2000.​

Answer 1

Answer:

The greatest common divisor (GCD) of a and b is the largest number that divides both of them with no remainder.

One way to find the GCD of two numbers is Euclid’s algorithm, which is based on the observation that if r is the remainder when a is divided by b, then gcd(a, b) = gcd(b, r). As a base case, we can use gcd(a, 0) = a.

Write a function called gcd that takes parameters a and b and returns their greatest common divisor.

Answer 2

Step-by-step explanation:

GCD 1000

please mark me brainlist

Answer 3

Step-by-step explanation:

GCD 2000

please mark me brainlist

Answer 4

Step-by-step explanation:

GCD 1000

please mark me brainlist