HowManyNumbers Logo

Greatest Common Divisor (GCD) of 133 and 132

The greatest common divisor (GCD) of 133 and 132 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 133 and 132?

We use the Euclidean algorithm, which involves the following steps:

  1. Divide the larger number by the smaller number.
  2. Replace the larger number with the smaller number and the smaller number with the remainder from the division.
  3. Repeat this process until the remainder is zero.
  4. The non-zero remainder just before zero is the GCD.

Step-by-Step Euclidean Algorithm

StepCalculation
1 133 ÷ 132 = 1 remainder 1
2 132 ÷ 1 = 132 remainder 0

Examples of GCD Calculations

NumbersGCD
13 and 621
174 and 851
87 and 1631
151 and 1121
159 and 813

Try Calculating GCD of Other Numbers







Related Calculators