Greatest Common Divisor (GCD) of 46 and 125
The greatest common divisor (GCD) of 46 and 125 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 46 and 125?
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 | 46 ÷ 125 = 0 remainder 46 |
| 2 | 125 ÷ 46 = 2 remainder 33 |
| 3 | 46 ÷ 33 = 1 remainder 13 |
| 4 | 33 ÷ 13 = 2 remainder 7 |
| 5 | 13 ÷ 7 = 1 remainder 6 |
| 6 | 7 ÷ 6 = 1 remainder 1 |
| 7 | 6 ÷ 1 = 6 remainder 0 |
Examples of GCD Calculations
| Numbers | GCD |
|---|---|
| 33 and 116 | 1 |
| 77 and 54 | 1 |
| 52 and 152 | 4 |
| 97 and 59 | 1 |
| 184 and 79 | 1 |