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