We are asked to find the greatest common divisor (GCD) of the numbers:
−868,−366, and −34
Step 1: Use the fact that GCD of negative numbers is the same as for their absolute values.
So,
gcd(−868,−366,−34)=gcd(868,366,34)
Step 2: Find the GCD of 868, 366, and 34
We can do this step-by-step using the Euclidean Algorithm.
First, compute gcd(868,366)
Use the Euclidean algorithm:
868÷366=2 remainder 136⇒gcd(868,366)=gcd(366,136)
Now compute gcd(366,136):
366÷136=2 remainder 94⇒gcd(366,136)=gcd(136,94)
Now compute gcd(136,94):
136÷94=1 remainder 42⇒gcd(136,94)=gcd(94,42)
Now compute gcd(94,42):
94÷42=2 remainder 10⇒gcd(94,42)=gcd(42,10)
Now compute gcd(42,10):
42÷10=4 remainder 2⇒gcd(42,10)=gcd(10,2)
Now compute gcd(10,2):
10÷2=5 remainder 0⇒gcd(10,2)=2
So, gcd(868,366)=2
Next, compute gcd(2,34)
34÷2=17 remainder 0⇒gcd(2,34)=2
✅ Final Answer:
gcd(−868,−366,−34)=gcd(868,366,34)=2