Question 1173843
<br>
10 letters; of which there are 3 O's, 2 P's, and 2 R's.<br>
By a basic counting principle....<br>
{{{10!/((3!)(2!)(2!))}}}<br>
Use a calculator if a numerical answer is needed.<br>
Note that the general principle is that the number of arrangements is the factorial of the total number of letters, divided by the factorials of the numbers of times each letter is repeated.<br>
Using that general principle, the problem can be seen this way:<br>
10 letters; of which there are 3 O's, 2 P's, 2 R's, 1 T, 1 I, and 1 N.<br>
And the number of arrangements is<br>
{{{10!/((3!)(2!)(2!)(1!)(1!)(1!))}}}<br>
Of course the result is the same, since the factors of 1! do not alter the final answer.<br>