Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing
Ishaan94
Group Title
Number of ways the word 'SUCCESS' can be arranged, such that no two S's and C's are together.
@Zarkon
 2 years ago
 2 years ago
Ishaan94 Group Title
Number of ways the word 'SUCCESS' can be arranged, such that no two S's and C's are together. @Zarkon
 2 years ago
 2 years ago

This Question is Closed

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
And @siddhantsharan
 2 years ago

siddhantsharan Group TitleBest ResponseYou've already chosen the best response.2
Hold on. No. 120  24 = 96?
 2 years ago

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
I can't be sure of the answer. To convince me you would need to show working as well.
 2 years ago

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
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.
 2 years ago

Chumku Group TitleBest ResponseYou've already chosen the best response.0
no. of letters= 7 no. of s = 3 no. of c = 2 therfore no. of combination= 7!/2!3!
 2 years ago

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
Chumku read the question again.
 2 years ago

Chumku Group TitleBest ResponseYou've already chosen the best response.0
oh i get it sorry
 2 years ago

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
lol :( Byron left me an complicated answer. Integral and stuff.
 2 years ago

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
siddhan can you post the solution as well? or, a hint.
 2 years ago

siddhantsharan Group TitleBest ResponseYou've already chosen the best response.2
Yeahhh. Sorry. Do you want the solution or hint?
 2 years ago

siddhantsharan Group TitleBest ResponseYou've already chosen the best response.2
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)
 2 years ago

siddhantsharan Group TitleBest ResponseYou've already chosen the best response.2
Does that seem correct so far? @Ishaan94
 2 years ago

siddhantsharan Group TitleBest ResponseYou've already chosen the best response.2
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!
 2 years ago

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
And it also proves how simple this problem could be
 2 years ago

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
And how stupid I think at times sigh
 2 years ago

siddhantsharan Group TitleBest ResponseYou've already chosen the best response.2
Yeah. It's pretty simple now.
 2 years ago

siddhantsharan Group TitleBest ResponseYou've already chosen the best response.2
Anytime :)
 2 years ago
See more questions >>>
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.