The GCD of given numbers is 27.
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 still positive (), so we will continue with division.
Step 3 :
Divide by and get the remainder
The remainder is zero => GCD is the last divisor .
We can summarize an algorithm into a following table.
2025 | : | 513 | = | 3 | remainder ( 486 ) | ||||
513 | : | 486 | = | 1 | remainder ( 27 ) | ||||
486 | : | 27 | = | 18 | remainder ( 0 ) | ||||
GCD = 27 |
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.