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

permutations: how many different groups of four letters can be made from the letters A-F (6 letters) if letters can only be used once?

OpenStudy (anonymous):

hi! can I help you??

OpenStudy (anonymous):

@soapia

OpenStudy (anonymous):

yes!

OpenStudy (anonymous):

oh thanx

OpenStudy (anonymous):

In a combination, the order doesn't matter. This is like drawing 5 cards for a poker hand. You can arrange them how you want once you have them. Or a lottery ball problem. You can match the balls, regardless of what order they were drawn. Or rolling 5 dice

OpenStudy (anonymous):

When you have n things to choose from ... you have n choices each time! When choosing r of them, the permutations are: n × n × ... (r times) (In other words, there are n possibilities for the first choice, THEN there are n possibilites for the second choice, and so on, multplying each time.)

OpenStudy (anonymous):

So I think, to find the answer its a easy go! right

OpenStudy (anonymous):

i think this is a combination without repetition

OpenStudy (anonymous):

\[6!\quad =6\quad *\quad 5*\quad 4*\quad 3*\quad 2\quad *1=\quad 720\\ you\quad can\quad do\quad \it now!\]

OpenStudy (anonymous):

P(6,6) = 6! / (6 - 6)! = 720

OpenStudy (anonymous):

that is not a permutation because here we r talking about subsets

OpenStudy (anonymous):

that question has not meaning to me there will be only a subset of 4 letters because to make the another subset u need necessarily to repeat e letters or more

OpenStudy (anonymous):

|dw:1368215246920: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!