2 x 2 = 4
2 x 5 = 10
The GCF is 2.
Chat with our AI personalities
If you construct them correctly, factor trees always work to determine the prime factorization of a number. Once you compare the prime factorizations of two or more numbers, it is relatively easy to find the greatest common factor of them from there.
Prime factorization and the Euclidean algorithm
The same as with smaller numbers. Every composite number, no matter the size, can be expressed as the product of prime factors. Comparing prime factorizations will give you the GCF.
Greatest common factor of 20 & 51 is 1. Factors of 20 are 1, 2, 4, 5, 10 & 20. Factors of 51 are 1, 3, 17 & 51. The only common factor is 1, so GCF is 1. Alternate method: Prime factorization of 20 = 2x2x5 Prime factorization of 51 = 3x17 From the prime factorizations it is clear that 1 is the GCF of 20 and 51.
Example: 30 and 42 List the factors. 1,2,3,5,6,10,15,30 1,2,3,6,7,14,21,42 Select the common factors. 1,2,3 and 6, the GCF.