HowManyNumbers Logo

Greatest Common Divisor (GCD) of 195 and 148

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

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 195 ÷ 148 = 1 remainder 47
2 148 ÷ 47 = 3 remainder 7
3 47 ÷ 7 = 6 remainder 5
4 7 ÷ 5 = 1 remainder 2
5 5 ÷ 2 = 2 remainder 1
6 2 ÷ 1 = 2 remainder 0

Examples of GCD Calculations

NumbersGCD
32 and 1724
141 and 851
17 and 591
35 and 1291
14 and 1062

Try Calculating GCD of Other Numbers







Related Calculators