Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

Number of ways the word 'SUCCESS' can be arranged, such that no two S's and C's are together. @Zarkon

See more answers at
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


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

Hold on. No. 120 - 24 = 96?

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

I can't be sure of the answer. To convince me you would need to show working as well.
In my textbook 36 is the given answer. But I don't think it's right, now that siddhant and another guy I knew answered 96 instead.
no. of letters= 7 no. of s = 3 no. of c = 2 therfore no. of combination= 7!/2!3!
Chumku read the question again.
oh i get it sorry
lol :( Byron left me an complicated answer. Integral and stuff.
siddhan can you post the solution as well? or, a hint.
Yeahhh. Sorry. Do you want the solution or hint?
Actually since you're not sure, I think I should post my solution. I may be wrong. So, No. of cases with no two C's together and no two S's together = No. of cases with no two S's together ( C's can me arranged anyhow) - No. of cases with no two S's together ( C's being together now)
Does that seem correct so far? @Ishaan94
It does
|dw:1340389706521:dw| Writing the letters with spaces between them. And only putting S's in the spaces so as to ensure their seperation. Total ways of doing this ( S's together C's anyhow) : 5C2 * 4!/2!
And it also proves how simple this problem could be
And how stupid I think at times -sigh-
Yeah. It's pretty simple now.
Thank you
Anytime :)

Not the answer you are looking for?

Search for more explanations.

Ask your own question