What is the Greatest Common Factor of 85961 and 85978?

Greatest common factor (GCF) of 85961 and 85978 is 1.

GCF(85961,85978) = 1

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

How to find the GCF of 85961 and 85978?

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

Step-1: Prime Factorization of 85961

Prime factors of 85961 are 67, 1283. Prime factorization of 85961 in exponential form is:

85961 = 67¹ × 1283¹

Step-2: Prime Factorization of 85978

Prime factors of 85978 are 2, 42989. Prime factorization of 85978 in exponential form is:

85978 = 2¹ × 42989¹

Step-3: Factors of 85961

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

1, 67, 1283

Step-4: Factors of 85978

List of positive integer factors of 85978 that divides 85961 without a remainder.

1, 2, 42989

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 85961 and 85978