What is the Greatest Common Factor of 3950 and 3968?

Greatest common factor (GCF) of 3950 and 3968 is 2.

GCF(3950,3968) = 2

We will now calculate the prime factors of 3950 and 3968, than find the greatest common factor (greatest common divisor (gcd)) of the numbers by matching the biggest common factor of 3950 and 3968.

How to find the GCF of 3950 and 3968?

We will first find the prime factorization of 3950 and 3968. After we will calculate the factors of 3950 and 3968 and find the biggest common factor number .

Step-1: Prime Factorization of 3950

Prime factors of 3950 are 2, 5, 79. Prime factorization of 3950 in exponential form is:

3950 = 2¹ × 5² × 79¹

Step-2: Prime Factorization of 3968

Prime factors of 3968 are 2, 31. Prime factorization of 3968 in exponential form is:

3968 = 2⁷ × 31¹

Step-3: Factors of 3950

List of positive integer factors of 3950 that divides 3950 without a remainder.

1, 2, 5, 10, 25, 50, 79, 158, 395, 790, 1975

Step-4: Factors of 3968

List of positive integer factors of 3968 that divides 3950 without a remainder.

1, 2, 4, 8, 16, 31, 32, 62, 64, 124, 128, 248, 496, 992, 1984

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 3950 and 3968. The biggest common factor number is the GCF number.
So the greatest common factor 3950 and 3968 is 2.

Also check out the Least Common Multiple of 3950 and 3968