Find Greatest Common Divisor of 48 and 36, using Euclidean algorithm.
Answer
The GCD of given numbers is 12.
Explanation
Step 1 :
Divide $ 48 $ by $ 36 $ and get the remainder
The remainder is positive ($ 12 > 0 $), so we will continue with division.
Step 2 :
Divide $ 36 $ by $ \color{blue}{ 12 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 12 }} $.
We can summarize an algorithm into a following table.
| 48 | : | 36 | = | 1 | remainder ( 12 ) | ||
| 36 | : | 12 | = | 3 | remainder ( 0 ) | ||
| GCD = 12 | |||||||
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