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