Greatest Common Divisor (GCD) of 60 and 103
The greatest common divisor (GCD) of 60 and 103 is 1.
What is the Greatest Common Divisor (GCD)?
The GCD of two integers is the largest positive integer that divides both numbers without leaving a remainder. It is useful in simplifying fractions, finding common factors, and in number theory.
How to Calculate the GCD of 60 and 103?
We use the Euclidean algorithm, which involves the following steps:
- Divide the larger number by the smaller number.
- Replace the larger number with the smaller number and the smaller number with the remainder from the division.
- Repeat this process until the remainder is zero.
- The non-zero remainder just before zero is the GCD.
Step-by-Step Euclidean Algorithm
| Step | Calculation |
|---|---|
| 1 | 60 ÷ 103 = 0 remainder 60 |
| 2 | 103 ÷ 60 = 1 remainder 43 |
| 3 | 60 ÷ 43 = 1 remainder 17 |
| 4 | 43 ÷ 17 = 2 remainder 9 |
| 5 | 17 ÷ 9 = 1 remainder 8 |
| 6 | 9 ÷ 8 = 1 remainder 1 |
| 7 | 8 ÷ 1 = 8 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 176 and 138 | 2 |
| 46 and 169 | 1 |
| 128 and 102 | 2 |
| 180 and 139 | 1 |
| 187 and 168 | 1 |