Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

Ishaan94

  • 2 years ago

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

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

    And @siddhantsharan

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

    \[7!/2!3!\]

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

    Hold on. No. 120 - 24 = 96?

  4. Ishaan94
    • 2 years ago
    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.

  5. Ishaan94
    • 2 years ago
    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.

  6. Chumku
    • 2 years ago
    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!

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

    Chumku read the question again.

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

    know*

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

    oh i get it sorry

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

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

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

    a*

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

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

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

    siddhant*

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

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

  15. siddhantsharan
    • 2 years ago
    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)

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

    Does that seem correct so far? @Ishaan94

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

    It does

  18. siddhantsharan
    • 2 years ago
    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!

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

    And it also proves how simple this problem could be

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

    And how stupid I think at times -sigh-

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

    Yeah. It's pretty simple now.

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

    Thank you

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

    Anytime :)

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

    • Attachments:

Ask your own question

Ask a Question
Find more explanations on OpenStudy

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.