What is the Greatest Common Factor of 42951 and 42968?

Greatest common factor (GCF) of 42951 and 42968 is 1.

GCF(42951,42968) = 1

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

How to find the GCF of 42951 and 42968?

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

Step-1: Prime Factorization of 42951

Prime factors of 42951 are 3, 103, 139. Prime factorization of 42951 in exponential form is:

42951 = 3¹ × 103¹ × 139¹

Step-2: Prime Factorization of 42968

Prime factors of 42968 are 2, 41, 131. Prime factorization of 42968 in exponential form is:

42968 = 2³ × 41¹ × 131¹

Step-3: Factors of 42951

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

1, 3, 103, 139, 309, 417, 14317

Step-4: Factors of 42968

List of positive integer factors of 42968 that divides 42951 without a remainder.

1, 2, 4, 8, 41, 82, 131, 164, 262, 328, 524, 1048, 5371, 10742, 21484

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 42951 and 42968. The biggest common factor number is the GCF number.
So the greatest common factor 42951 and 42968 is 1.

Also check out the Least Common Multiple of 42951 and 42968