Find Greatest Common Divisor of 26 and 76, using Euclidean algorithm.
Answer
The GCD of given numbers is 2.
Explanation
Step 1 :
Divide $ 76 $ by $ 26 $ and get the remainder
The remainder is positive ($ 24 > 0 $), so we will continue with division.
Step 2 :
Divide $ 26 $ by $ \color{blue}{ 24 } $ and get the remainder
The remainder is still positive ($ 2 > 0 $), so we will continue with division.
Step 3 :
Divide $ 24 $ by $ \color{blue}{ 2 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 2 }} $.
We can summarize an algorithm into a following table.
| 76 | : | 26 | = | 2 | remainder ( 24 ) | ||||
| 26 | : | 24 | = | 1 | remainder ( 2 ) | ||||
| 24 | : | 2 | = | 12 | remainder ( 0 ) | ||||
| GCD = 2 | |||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.
This page was created using
GCD Calculator