If they have no prime factors in common, their GCF is 1.
If there are no prime factors in common, the GCF is 1.
7
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.
You do a factor rainbow to find a prime factorization. You compare prime factorizations to find a greatest common factor.
Prime factorization and the Euclidean algorithm
Actually, both can be true, but the answer your teacher is probably looking for is "greatest."
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.
If the prime factorizations have no factors in common, the LCM is the product of them.
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.
Since you're not looking for the numbers with the decimals, the greatest common factor would just be 4.
If none of the prime factors are in common, the LCM will be the product of the two.
The word "common" means "same for all". There's nothing common about a single thing, There's no common factor of a single number. Before you can start looking for common factors, you need at least 2 different numbers.