Question 1160524
<font color=black size=3>
For the word "repetition", we have 10 letters. So there are 
10! = 10*9*8*7*6*5*4*3*2*1 = 3,628,800
different ways to arrange them, but only if we can tell the two 'e's apart, and the same goes for the 'i's and the 't's as well. 


Since we can't distinguish these letters, we have to divide by 2! = 2*1 = 2 for each repeated letter. This is to avoid double counting per either the 'e's, 'i's or 't's.


So we have (3,628,800)/(2!*2!*2!) = (3,628,800)/(2*2*2) = 453,600 permutations when we cannot distinguish between the repeated letters mentioned above. 


Final Answer = <font color=red>453,600</font>

</font>