The GCD of given numbers is 256.
Step 1 :
Divide by and get the remainder
The remainder is positive (), so we will continue with division.
Step 2 :
Divide by and get the remainder
The remainder is zero => GCD is the last divisor .
We can summarize an algorithm into a following table.
1024 | : | 768 | = | 1 | remainder ( 256 ) | ||
768 | : | 256 | = | 3 | remainder ( 0 ) | ||
GCD = 256 |
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.