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

A simple combinatorics problem. Word 'SUCCESS'. Number of ways such that no two Ss and Cs are together.

OpenStudy (anonymous):

@eliassaab @blockcolder

OpenStudy (anonymous):

my guess is 360....idk if i solved it rite....anyone??

OpenStudy (anonymous):

360!?! :o How?

OpenStudy (anonymous):

well its wrong sry!!

OpenStudy (anonymous):

Of course it is.

ganeshie8 (ganeshie8):

396 ?

OpenStudy (anonymous):

Noway Dude

OpenStudy (anonymous):

factorial of 6??

OpenStudy (anonymous):

Nope

OpenStudy (anonymous):

Stop guessing. Take your time and work on the problem.

OpenStudy (anonymous):

And for your information, this problem is not some challenge. I don't know how to do it. So you will have to show your work.

OpenStudy (anonymous):

|dw:1340534838304:dw| can be interchange so that no S are together in only 2 ways........ |dw:1340534915656:dw| 6 spaces can be filled by 2 Es in ....6c3/2 ways...... |dw:1340534979616:dw|.. so final answer is 15

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!