1. Get the source numerical values
Numerator is -333
Denominator is -33
the source fraction is
2. Calculate the greatest common divisor (GCD) using the Euclidean algorithm
1)
let -33 is a, -333 is b, then:
-33 / -333 = 0 ...... -33
remainder is -33, not eq 0, so go on...
2)
let -333 is a, -33 is b, then:
-333 / -33 = 10 ...... -3
remainder is -3, not eq 0, so go on...
3)
let -33 is a, -3 is b, then:
-33 / -3 = 11 ...... 0
remainder is 0, eq 0, the Greatest Common Divisor (GCD) of -333 and -33 is -3
3. Finally
Found GCD of -333 and -33 is -3
= =