in how many letters of SUCCESS can be arranged such that no two C or no two S are together.
Follow Math Help Forum on Facebook and Google+
Originally Posted by ayushdadhwal in how many letters of SUCCESS can be arranged such that no two C or no two S are together. Let be the set of all rearrangements in which no to S's are together. Let be the set of all rearrangements in which no to C's are together. The number in is . Now you must calculate
View Tag Cloud