HowManyNumbers Logo

Greatest Common Divisor (GCD) of 95 and 145

The greatest common divisor (GCD) of 95 and 145 is 5.

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 95 and 145?

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 95 ÷ 145 = 0 remainder 95
2 145 ÷ 95 = 1 remainder 50
3 95 ÷ 50 = 1 remainder 45
4 50 ÷ 45 = 1 remainder 5
5 45 ÷ 5 = 9 remainder 0

Examples of GCD Calculations

NumbersGCD
71 and 1371
149 and 141
171 and 1053
88 and 371
197 and 1691

Try Calculating GCD of Other Numbers







Related Calculators