What is the Greatest Common Factor of 83957 and 83968?

Greatest common factor (GCF) of 83957 and 83968 is 1.

GCF(83957,83968) = 1

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

How to find the GCF of 83957 and 83968?

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

Step-1: Prime Factorization of 83957

Prime factors of 83957 are 59, 1423. Prime factorization of 83957 in exponential form is:

83957 = 59¹ × 1423¹

Step-2: Prime Factorization of 83968

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

83968 = 2¹¹ × 41¹

Step-3: Factors of 83957

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

1, 59, 1423

Step-4: Factors of 83968

List of positive integer factors of 83968 that divides 83957 without a remainder.

1, 2, 4, 8, 16, 32, 41, 64, 82, 128, 164, 256, 328, 512, 656, 1024, 1312, 2048, 2624, 5248, 10496, 20992, 41984

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 83957 and 83968