# Euclidean Algorithm : Finding the Greatest Common Divisor

Not what you're looking for? Search our solutions OR ask your own Custom question.

Use the euclidean algorithm to find the greatest common divisor of 981 and 1234.

Â© BrainMass Inc. brainmass.com December 24, 2021, 4:51 pm ad1c9bdddfhttps://brainmass.com/math/discrete-math/euclidean-algorithm-finding-the-greatest-common-divisor-11579

#### Solution Summary

The greatest commn divisr is found using the Euclidean algorithm. The solution is detailed and well presented.

$2.49