Greatest Common Factor of 13 and 6968
GCF(13, 6968) = 13, Greatest common factor of 13 and 6968 is 13. 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 13 and 6968. Greatest Common Factor by prime factorization method and Greatest Common Factor by matching factors method.
Greatest Common Factor of 13 and 6968 by prime factorization method
We will first find the prime factorization of 13 and 6968.
Prime Factorization of 13 is 1, 13 and Prime Factorization of 6968 is 1, 2, 2, 2, 13, 67.
- Factorize\( (13) = \) \(1\times 13\)
- Factorize\( (6968) = \) \(1\times 2\times 2\times 2\times 13\times 67\)
Now we need to find any which are common for each number (1, 13) and multiply these numbers together.
\(GCF(13, 6968) = 1\times 13 = 13\).
Greatest Common Factor of 13 and 6968 by matching factors method
List of positive integers factors of 13 leaving a remainder zero is 1, 13
List of positive integers factors of 6968 leaving a remainder zero is 1, 2, 4, 8, 13, 26, 52, 67, 104, 134, 268, 536, 871, 1742, 3484, 6968
As you can see, 13 is the greatest and common number that 13 and 6968 divides into.
So the greatest common factor 13 and 6968 is 13.
\(GCF(13, 6968) = 13\).
If you want to learn more about greatest common divisor, take a look at the Wikipedia page.
