## Algebra 2 (1st Edition)

Published by McDougal Littell

# Chapter 10 Counting Methods and Probability - 10.1 Apply the counting Principles and Permutations - Guided Practice for Example 6 - Page 686: 10

#### Answer

$50400$

#### Work Step by Step

CINCINNATI has $10$ characters, out of which $C$ is repeated twice, $I$ and $N$ are repeated $3$ times and $A$ and $T$ appear once. Thus using the formula for permutations with repetitions, the number of distinguishable permutations of the letters in the word is: $\frac{10!}{3!3!2!}=50400$

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.