Greatest Common Divisor (GCD) of 61 and 145
The greatest common divisor (GCD) of 61 and 145 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 61 and 145?
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 | 61 ÷ 145 = 0 remainder 61 |
| 2 | 145 ÷ 61 = 2 remainder 23 |
| 3 | 61 ÷ 23 = 2 remainder 15 |
| 4 | 23 ÷ 15 = 1 remainder 8 |
| 5 | 15 ÷ 8 = 1 remainder 7 |
| 6 | 8 ÷ 7 = 1 remainder 1 |
| 7 | 7 ÷ 1 = 7 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 41 and 103 | 1 |
| 173 and 118 | 1 |
| 118 and 48 | 2 |
| 130 and 30 | 10 |
| 74 and 57 | 1 |