Greatest Common Factor of 968 and 8157
GCF(968, 8157) = 1, Greatest common factor of 968 and 8157 is 1. Greatest Common Factor or Greatest Common Divisor of two numbers is the largest integer by which both the numbers can be divided. There are two different methods to calculate Greatest Common Factor of 968 and 8157. Greatest Common Factor by prime factorization method and Greatest Common Factor by matching factors method.
Greatest Common Factor of 968 and 8157 by prime factorization method
We will first find the prime factorization of 968 and 8157.
Prime Factorization of 968 is 1, 2, 2, 2, 11, 11 and Prime Factorization of 8157 is 1, 3, 2719.
- Factorize\( (968) = \) \(1\times 2\times 2\times 2\times 11\times 11\)
- Factorize\( (8157) = \) \(1\times 3\times 2719\)
Now we need to find any which are common for each number (1, 1) and multiply these numbers together.
\(GCF(968, 8157) = 1\times 1 = 1\).
Greatest Common Factor of 968 and 8157 by matching factors method
List of positive integers factors of 968 leaving a remainder zero is 1, 2, 4, 8, 11, 22, 44, 88, 121, 242, 484, 968
List of positive integers factors of 8157 leaving a remainder zero is 1, 3, 2719, 8157
As you can see, 1 is the greatest and common number that 968 and 8157 divides into.
So the greatest common factor 968 and 8157 is 1.
\(GCF(968, 8157) = 1\).
If you want to learn more about greatest common divisor, take a look at the Wikipedia page.
