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.
There are 6 pockets all together. You checked two of them and it wasn't
there. So you can forget about those 2, and now there are 4 pockets left.
The total number of ways for your next try is 4.
The number that will be successful is 1.
The probability of success on the next one is <em>1/4 = 25% .</em>
=======================================================
Another method of solution, somewhat more complex:
Total number of pockets = 6.
Amount of money missing = $10
First partial sum, i.e. sum of numbers
in the first part of the problem = 6 + 10 = 16.
Total number of pockets = 6
Current value of cargo pants on a fashion scale from 1 to 10 = -2.
Second partial sum = 6 - 2 = 4.
Probability = (second partial sum) / (first partial sum) = 4/16 = <em>25% </em>.
-4p^2 - 9p + 2 ezzzzzzz just switch the signs bruhhhh
Answer:
1. 3(9K-2)
2. 5(x+12y)
Step-by-step explanation:
The person sitting next to me was very sensitive.