Wiki User
∙ 9y agoit is easier to find the prime factorization because you do not have to keep multiplying over and over and over again!!!!
Wiki User
∙ 9y agoWiki User
∙ 8y agoI would rather find the prime factors.
If you take all the common prime factors between numbers and multiply them it will give you the gcf.
Prime factorization and the Euclidean algorithm
That's the prime factorization.
In order to find the common factors of 144 and 100, we follow the following steps:Step 1: Find the HCF of 144 and 100.Prime factorization of 144 = 2x2x2x2x3x3Prime factorization of 100 = 2x2x5x5HCF(144,100) = 2x2 = 22 = 4.Step 2: Find the factors of HCF(144,100) i.e. 4. The factors of 4 are the common factors of 144 and 100.Factors of 4 are 1, 2 and 4.So, common factors of 144 and 100 are 1, 2 and 4.
Prime factorization of 45 = 3x3x5Prime factorization of 60 = 2x2x3x5Prime factorization of 160 = 2x2x2x2x2x5Only common factors are 5 (and 1).Therefore GCF = 5.
you multiply them together
The answer is 6.You need to do a prime factorization of the 2 numbers first. Then compare the 2 numbers and see what the greatest number they have in common is in the factorization of them. Next times what they have in common and there is your answer. The factorization of 132=11x3x2x2 The factorization of 150=5x5x3x2 There is a 2 and a 3 in each, so you multiply them both and you get 6.
The prime factorization of 2016588 is 2 x 2 x 3 x 7 x 24007. For any of them to be common, you need to compare them to another set of factors.
If you take all the common prime factors between numbers and multiply them it will give you the gcf.
do the prime factorization of the 3 numbers. list the prime factors of all the 3 numbers. circle the factors that are common to the 3. multiply them. that number is the HCF
The GCF of 420, 735, and 945 is 105.The prime factorization of 420 is 2x2x3x5x7The prime factorization of 735 is 3x5x7x7The prime factorization of 945 is 3x3x3x5x7(1) List the prime factors of each number.(2) Multiply those factors all numbers in the set have in common. If there are no common prime factors, the GCF is 1. (Those factors are the ones in bold type.)As you can see the GCF is 3x5x7 or 105
you use prime factorization
Prime factorization tells you what prime numbers multiply to get the number. You can see which numbers that number is divisible by to get the multiples and factors.
The prime factorization of 12 is 2 x 2 x 3. To find something in common, you need to compare it to another prime factorization. To save you the trouble, the least common factor of 12 and any other number is 1.
For a number to have common factors, there needs to be another number to compare its factors with.
Prime factorization and the Euclidean algorithm
You do not necessarily need the common prime factors when finding the greatest common factor, but with large numbers or numbers for which you cannot easily determine all the factors, using prime factorization to determine the greatest common factor is the easiest method. The greatest common factor can then be determined by multiplying the common prime factors together. For example, when trying to find the greatest common factor of 2144 and 5672, finding all their possible factors to compare could be difficult. So, it is easier to find their prime factors, determine the prime factors they have in common, and then multiply the common prime factors to get the greatest common factor. For descriptions and examples of finding the greatest common factor, see the "Related Questions" links below.