The GCD of given numbers is 19.
Step 1 :
Divide $ 627 $ by $ 19 $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 19 }} $.
We can summarize an algorithm into a following table.
627 | : | 19 | = | 33 | remainder ( 0 ) |
GCD = 19 |
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.