Quantcast

Got Homework?

Connect with other students for help. It's a free community.

  • across
    MIT Grad Student
    Online now
  • laura*
    Helped 1,000 students
    Online now
  • Hero
    College Math Guru
    Online now

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

Ishaan94

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

  • one year ago
  • one year ago

  • This Question is Closed
  1. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 1

    And @siddhantsharan

    • one year ago
  2. Chumku
    Best Response
    You've already chosen the best response.
    Medals 0

    \[7!/2!3!\]

    • one year ago
  3. siddhantsharan
    Best Response
    You've already chosen the best response.
    Medals 2

    Hold on. No. 120 - 24 = 96?

    • one year ago
  4. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 1

    I can't be sure of the answer. To convince me you would need to show working as well.

    • one year ago
  5. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 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.

    • one year ago
  6. Chumku
    Best Response
    You've already chosen the best response.
    Medals 0

    no. of letters= 7 no. of s = 3 no. of c = 2 therfore no. of combination= 7!/2!3!

    • one year ago
  7. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 1

    Chumku read the question again.

    • one year ago
  8. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 1

    know*

    • one year ago
  9. Chumku
    Best Response
    You've already chosen the best response.
    Medals 0

    oh i get it sorry

    • one year ago
  10. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 1

    lol :( Byron left me an complicated answer. Integral and stuff.

    • one year ago
  11. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 1

    a*

    • one year ago
  12. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 1

    siddhan can you post the solution as well? or, a hint.

    • one year ago
  13. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 1

    siddhant*

    • one year ago
  14. siddhantsharan
    Best Response
    You've already chosen the best response.
    Medals 2

    Yeahhh. Sorry. Do you want the solution or hint?

    • one year ago
  15. siddhantsharan
    Best Response
    You've already chosen the best response.
    Medals 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)

    • one year ago
  16. siddhantsharan
    Best Response
    You've already chosen the best response.
    Medals 2

    Does that seem correct so far? @Ishaan94

    • one year ago
  17. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 1

    It does

    • one year ago
  18. siddhantsharan
    Best Response
    You've already chosen the best response.
    Medals 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!

    • one year ago
  19. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 1

    And it also proves how simple this problem could be

    • one year ago
  20. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 1

    And how stupid I think at times -sigh-

    • one year ago
  21. siddhantsharan
    Best Response
    You've already chosen the best response.
    Medals 2

    Yeah. It's pretty simple now.

    • one year ago
  22. Ishaan94
    Best Response
    You've already chosen the best response.
    Medals 1

    Thank you

    • one year ago
  23. siddhantsharan
    Best Response
    You've already chosen the best response.
    Medals 2

    Anytime :)

    • one year ago
    • Attachments:

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
  • 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.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.