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: 32

Answer

$360$

Work Step by Step

To count the number of permutations of letters of AARDVARK with the 3 A's consecutive, we can treat the 3 consecutive A's as one letter, i.e. count the number of permutations of 2 R's (indistinguishable from each other), 1 D, 1 V, 1 K, and 1 "AAA", for a total of 6 "letters". By Theorem 3 on page 428, the number of permutations is: $\frac{6!}{2!1!1!1!1!}$ $=\frac{1*2*3*4*5*6}{1*2}$ $=3*4*5*6$ $=360$
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.