lmeStepha4naptain6 lmeStepha4naptain6
  • 22-11-2016
  • Mathematics
contestada

How many different strings can be made from the letters in MISSISSIPPI, using all the letters and having no consecutive S's? ...?

Respuesta :

metchelle
metchelle metchelle
  • 24-11-2016
Here is the answer to the given question above.
Since there are 1 "M", 4 "I"s, 4 "S"s, 2 "P"s : totally 11 letters, we can get the final answer:11! / ( 1! * 4! * 4! * 2! ) = 34650
Therefore, the answer would be 34650 different strings can be made from the letters of MISSISSIPPI, using all the letters having no consecutive S's. Hope this answer helps. 
Answer Link

Otras preguntas

Can all n times n matrices be orthogonalized? 1) True 2) False
What are all the locations where the humerus may fracture?
Solve 4 1/2 < x 2 1/8 then graph the solution
Choose the correct term for 'pertaining to herpes."A) HerpeticB) HerpanginaC) HerpesvirusD) Herpetiform"
An ORDER BY clause may include fields, aggregate functions, and mathematical expressions involving fields and aggregate functions -True -False
Human lateral inhibition is most likely accomplished by _____. a. end-stopped cells b. extrastriate cells c. bipolar cells d. dissociative cells
What does the truck driver do to show his friendship with XT-115 in "Night Rider" by Steven Otfinoski? A. Pays for his meal and gives him his truck bed to sleep
Find fracdwdx if u = frac 12x³, v=3(u + u²), and w = frac1v². Are you applying the chain rule correctly?
Who will be the project leader for RM framework development ?
Unit 4: Congruent Triangles Homework 1: Classifying Triangles. I need all the help I can get, thank you. :)