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.
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