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