Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 6 - Section 6.5 - Generalized Permutations and Combinations - Exercises - Page 433: 30

Answer

$34650$

Work Step by Step

In "MISSISSIPPI", there are 1 M, 4 I's, 4 S's, and 2 P's, for a total of 11 letters. So we are trying to calculate the number of permutations of 11 letters, with the 4 I's indistinguishable from each other, 4 S's indistinguishable from each other, and 2 P's indistinguishable from each other. By Theorem 3 on page 428, the number of permutations is: $\frac{11!}{4!4!2!}$ $=\frac{1*2*3*4*5*6*7*8*9*10*11}{1*2*3*4*1*2*3*4*1*2}$ $=\frac{5*6*7*8*9*10*11}{1*2*3*4*1*2}$ $=34650$
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.