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