Greatest Common Divisor (GCD) of 59 and 190
The greatest common divisor (GCD) of 59 and 190 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 59 and 190?
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 | 59 ÷ 190 = 0 remainder 59 |
| 2 | 190 ÷ 59 = 3 remainder 13 |
| 3 | 59 ÷ 13 = 4 remainder 7 |
| 4 | 13 ÷ 7 = 1 remainder 6 |
| 5 | 7 ÷ 6 = 1 remainder 1 |
| 6 | 6 ÷ 1 = 6 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 169 and 64 | 1 |
| 167 and 146 | 1 |
| 168 and 98 | 14 |
| 29 and 63 | 1 |
| 127 and 149 | 1 |