Question

A simple combinatorics problem.

Word 'SUCCESS'. Number of ways such that no two Ss and Cs are together.

Answer 1

@eliassaab @blockcolder

Answer 2

my guess is 360....idk if i solved it rite....anyone??

Answer 3

360!?! :o How?

Answer 4

well its wrong sry!!

Answer 5

Of course it is.

Answer 6

396 ?

Answer 7

Noway Dude

Answer 8

factorial of 6??

Answer 9

Nope

Answer 10

Stop guessing. Take your time and work on the problem.

Answer 11

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.

Answer 12

can be interchange so that no S are together in only 2 ways........
6 spaces can be filled by 2 Es in ....6c3/2 ways......
..
so final answer is 15