Share
Explore BrainMass

Complex Numbers : Find Greatest Common Divisor ( GCD ) using the Euclidean Algorithm

Using the gcd for 85 and 1+13i, by the Euclidean Algorithm.

Solution Summary

A gcd is found using the Euclidean algorithm.

$2.19