anonymous
  • anonymous
A simple combinatorics problem. Word 'SUCCESS'. Number of ways such that no two Ss and Cs are together.
Mathematics
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this
and thousands of other questions

anonymous
  • anonymous
anonymous
  • anonymous
my guess is 360....idk if i solved it rite....anyone??
anonymous
  • anonymous
360!?! :o How?

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
well its wrong sry!!
anonymous
  • anonymous
Of course it is.
ganeshie8
  • ganeshie8
396 ?
anonymous
  • anonymous
Noway Dude
anonymous
  • anonymous
factorial of 6??
anonymous
  • anonymous
Nope
anonymous
  • anonymous
Stop guessing. Take your time and work on the problem.
anonymous
  • 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.
anonymous
  • 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
anonymous
  • anonymous
No the answer is not 15.
blockcolder
  • blockcolder
The complement of "no 2 S's and C's are together" is "2 S's or C's are together." 2 S's or C's together = 2 S's together + 2 C's together - 2 S's and 2 C's together 2 S's together = 5! by considering the 3 s's as 1 2 C's together = 6! by considering 2 c's as 1 2 S's and 2 C's together = 4! So it's 7!-(5!+6!-4!)=4224 ways.
anonymous
  • anonymous
Number of Letters/Characters in the word "SUCCESS" = 7 {S, U, C, C, E, S, S} No. of Letters : of the first kind ⇒ No. of S's = 3 ⇒ a = 3 of the second kind ⇒ No. of C's = 2 ⇒ b = 2 which are all different = 2 {U, E} ⇒ x = 2 = n=7!/3! × 2! = 7 × 6 × 5 × 4 × 3 × 2!/3 × 2 × 1 × 2! = 7 × 6 × 5 × 4 × 3 = 2,520
anonymous
  • anonymous
blockcoder you are including too many repetitive arrangements
ganeshie8
  • ganeshie8
answer cannot be more than 420
anonymous
  • anonymous
_S_S_S_ 4 spaces, 4 choices {C, C, E, U}. 4!/2! = 4*3 = 12. S_S_S__ -> 12 __S_S_S -> 12 So, 12 + 12 + 12 = 36. Haha Got it. Thanks all.
anonymous
  • anonymous
yeah i got it thanks!!
Callisto
  • Callisto
What about S__S_S_ , S_S__S_?
anonymous
  • anonymous
:(
anonymous
  • anonymous
I think, I included two repetitions
anonymous
  • anonymous
Ohh CCS_S_S and S_S_SCC isn't possible. It still comes out to be 36. Thanks Callisto.
Callisto
  • Callisto
If.... you have time.... and if ..... you don't mind, can you explain??

Looking for something else?

Not the answer you are looking for? Search for more explanations.