You can use prime factorization to find the GCF of a set of numbers. This often works better for large numbers, where generating lists of all factors can be time-consuming.
Here’s how to find the GCF of a set of numbers using prime factorization:
* List the prime factors of each number.
* Circle every common prime factor — that is, every prime factor that’s a factor of every number in the set.
* Multiply all the circled numbers.
The result is the GCF.
For example, suppose you want to find the GCF of 28, 42, and 70. Step 1 says to list the prime factors of each number. Step 2 says to circle every prime factor that’s common to all three numbers (as shown in the following figure).
As you can see, the numbers 2 and 7 are common factors of all three numbers. Multiply these circled numbers together:
2 · 7 = 14
Thus, the GCF of 28, 42, and 70 is 14.
C
You split inequality into
2x-2>8 and 2x—2<-8
X>5. X<-3
Answer: get it I guess
Step-by-step explanation:
Answer:
there needs to be at least 77 cakes sold
Step-by-step explanation:
let 'c' = # cakes sold
3.25c ≥ 250
c ≥ 250÷3.25
c ≥ 76.9
Yes it is correct, 7/12 is the equivalent to C. 7 divided by 12