Algebra 2 (1st Edition)

Published by McDougal Littell
ISBN 10: 0618595414
ISBN 13: 978-0-61859-541-9

Chapter 10 Counting Methods and Probability - 10.2 Use Combinations and the Binomial Theorem - 10.2 Exercises - Quiz for Lessons 10.1-10.2 - Page 697: 6



Work Step by Step

The word has $9$ characters, out of which $T$ appears once, $N,S$ appear twice and $E$ appears $4$ times. Thus using the formula for permutations with repetitions, the number of distinguishable permutations of the letters in the word is: $\frac{9!}{2!2!4!}=3780$
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.