Start by setting up a factor tree for each number.
Factor in anyway that you'd like.
At the end, circle all prime numbers.
Remember, prime numbers are numbers
with only 2 factors, 1 and the number itself.
Now write these factors in least to greatest
multiplying them separate rows.
Circle factors they have in common.
Since 3 pairs of two's match up, multiply by 2 three times to get 8.
So the GCF is 8.
Answer
The measurement of the missing sides are 4 cm on each side
Step-by-step explanation:
multiply 5 times 2 (5x2=10) take away the 10 and 18 and the answer for it is the answer for the whole thing.
Times means
2 times 3 means 3+3
4 times of 3=3+3+3+3
divide is
4 divided into 2 parts=2
6 divided into 3 parts=3
but you could multiply by a fraction and essensially divide
they are different
Find the number of distinguishable permutations of the letters m, i, s, s, i, s, s, i, p, p, i.
Tatiana [17]
Solution:
we have been asked to find the number of distinguishable permutations of the letters m, i, s, s, i, s, s, i, p, p, i.
Here we can see
m appears 1 time.
i appears 4 times.
S appears 4 times.
p appears 2 times.
Total number of letters are 11.
we will divide the permutation of total number of letters by the permutation of the number of each kind of letters.
The number of distinguishable permutations
Hence the number of distinguishable permutations
Answer:
Point A’ is at (-2,-2)
& point D' is at (4,-2)
Step-by-step explanation:
Point A’ => (-1×2, -1×2) => (-2 , -2)
Point D' => (2×2 , -1×2) => (4 , -2)