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