Browse · harp
Printjmc
counting and probability junior
Problem
In how many ways can the letters in be rearranged so that two or more s do not appear together?
(A)
(B)
(C)
(D)
Solution
All valid arrangements of the letters must be of the form The problem is equivalent to counting the arrangements of and into the four blanks, in which there are ways.
Final answer
D