Question 1110776
.
<pre>
There are 10 letters (symbols) in the word, in all.


Of them, there are 

    - 3 repeating (identical) "A", 

    - 2 repeating (identical) "T".

    - 2 repeating (identical) "C".


The number of distinguishable permutations is  P  = {{{10!/(3!*2!*2!)}}} = 151200.


3! in the denominator accounts for repeating "A",

2! in the denominator accounts for repeating "T",

3! in the denominator accounts for repeating "C".
</pre>

See the lesson

&nbsp;&nbsp;&nbsp;&nbsp;- <A HREF =https://www.algebra.com/algebra/homework/Permutations/Arranging-elements-of-sets-containing-undistinguishable-elements.lesson>Arranging elements of sets containing indistinguishable elements</A> 

in this site.


Also, &nbsp;you have this free of charge online textbook in ALGEBRA-II in this site

&nbsp;&nbsp;&nbsp;&nbsp;- <A HREF=https://www.algebra.com/algebra/homework/complex/ALGEBRA-II-YOUR-ONLINE-TEXTBOOK.lesson>ALGEBRA-II - YOUR ONLINE TEXTBOOK</A>.


The referred lesson is the part of this online textbook under the topic &nbsp;"<U>Combinatorics: Combinations and permutations</U>". 



Save the link to this textbook together with its description


Free of charge online textbook in ALGEBRA-II
https://www.algebra.com/algebra/homework/complex/ALGEBRA-II-YOUR-ONLINE-TEXTBOOK.lesson


into your archive and use when it is needed.