Ask your own question, for FREE!
Mathematics 9 Online
OpenStudy (anonymous):

Find the number of permutations in the word "computer"

OpenStudy (amistre64):

how many letters in the word?

OpenStudy (anonymous):

8

OpenStudy (amistre64):

and, are any of them repeated?

OpenStudy (anonymous):

no

OpenStudy (amistre64):

then all we have is 8! ways to arrange them.

OpenStudy (anonymous):

really? does that mean that the answer is 8?

OpenStudy (amistre64):

no, it means the answer is 8-factorial

OpenStudy (anonymous):

yeah exactly I think I need to find the fraction first and then the main answer

OpenStudy (amistre64):

the fraction ends up as 8!/0! which is just 8! ....

OpenStudy (anonymous):

that is greaat thank you! would you help me with another question?

OpenStudy (amistre64):

depends on the question i spose, i only have a limited amount of knowing each day before the dementia sets in :)

OpenStudy (anonymous):

haha okay so: How many ways can you purchase 5 CDs if there are 6 to choose from, 2 cassettes if there are 5 to choose from, and 4 DVDs if there are 8 to choose from?

OpenStudy (amistre64):

for a collection of n objects, where we want choose them in k ways. then the different ways are just nCk. which is equal to nPk/k!

OpenStudy (anonymous):

ok? so how would that go?

OpenStudy (amistre64):

lets take the cds ... there are 6 to choose from, and we want 5. that tells us there are 6C5 ways to select them.

OpenStudy (solomonzelman):

Looking at the initial post, 8 nPr 1 + 8 nPr 2 + 8 nPr 3 + .... + 8 nPr 8 .

OpenStudy (solomonzelman):

If you are choosing ANY amount of letters from "computer" ... idk

OpenStudy (anonymous):

Solomon you are solving my first question right? I think the answer to that one is 8

OpenStudy (anonymous):

now I need to figure out: How many ways can you purchase 5 CDs if there are 6 to choose from, 2 cassettes if there are 5 to choose from, and 4 DVDs if there are 8 to choose from?

OpenStudy (amistre64):

the counting rule for duplicates is:\[\frac{n!}{a!b!c!...k!}\]which may be useful for the 2nd stuff

OpenStudy (amistre64):

otherwise im thinking: \[(n_1Ck_1)*(n_2Ck_2)*(n_3Ck_3)\]

OpenStudy (anonymous):

I think I have to use the first one

OpenStudy (amistre64):

the first one is iffy to me, it counts the number of ways to permute all the objects, not subsets of them. at elast in my mind

OpenStudy (amistre64):

otherwise we can tree it as:|dw:1402072347763:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!