Greatest Common Divisor (GCD) of 148 and 149
The greatest common divisor (GCD) of 148 and 149 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 148 and 149?
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 | 148 ÷ 149 = 0 remainder 148 |
| 2 | 149 ÷ 148 = 1 remainder 1 |
| 3 | 148 ÷ 1 = 148 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 162 and 105 | 3 |
| 139 and 121 | 1 |
| 98 and 138 | 2 |
| 52 and 126 | 2 |
| 121 and 67 | 1 |