The GCD of given numbers is 91.
Step 1 :
Divide $ 3094 $ by $ 819 $ and get the remainder
The remainder is positive ($ 637 > 0 $), so we will continue with division.
Step 2 :
Divide $ 819 $ by $ \color{blue}{ 637 } $ and get the remainder
The remainder is still positive ($ 182 > 0 $), so we will continue with division.
Step 3 :
Divide $ 637 $ by $ \color{blue}{ 182 } $ and get the remainder
The remainder is still positive ($ 91 > 0 $), so we will continue with division.
Step 4 :
Divide $ 182 $ by $ \color{blue}{ 91 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 91 }} $.
We can summarize an algorithm into a following table.
| 3094 | : | 819 | = | 3 | remainder ( 637 ) | ||||||
| 819 | : | 637 | = | 1 | remainder ( 182 ) | ||||||
| 637 | : | 182 | = | 3 | remainder ( 91 ) | ||||||
| 182 | : | 91 | = | 2 | remainder ( 0 ) | ||||||
| GCD = 91 | |||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.