document.write( "Question 772496: what exactly is distinguishable permutations
\n" ); document.write( " \n" ); document.write( "

Algebra.Com's Answer #470926 by solver91311(24713) $\"\"$ $\"About$

You can put this solution on YOUR website!
\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Distinguishable permutations are permutations that can be distinguished from one another. In the case of a number of things where each is different from the other, such as the letters in the word FLANGE, there is no difference between the number of permutations and the number of distinguishable permutations. But if the original set of things has duplicates as in ABRACADABRA, which has eleven letters but only five that are distinctly different, the total number of permutations would be

, but the number of distinguishable permutations, ones where you can see a difference from one to the other, is only

(Note there are 5 As, 2 Bs, and 2 Rs, hence the numbers in the denominator)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "John
\n" ); document.write( "

\n" ); document.write( "Egw to Beta kai to Sigma
\n" ); document.write( "My calculator said it, I believe it, that settles it
\n" ); document.write( "

$\"The$

\n" ); document.write( " \n" ); document.write( "

\n" );