document.write( "Question 1009449: How many different \"words\" can be constructed using the word
\n" ); document.write( "STATISTICS, if the \"word\" should end with a vowel only? \n" ); document.write( "

Algebra.Com's Answer #624929 by Edwin McCravy(20060) $\"\"$ $\"About$

You can put this solution on YOUR website!
How many different \"words\" can be constructed using the word
\n" ); document.write( "STATISTICS, if the \"word\" should end with a vowel only?
\n" ); document.write( "

\r\n" );
document.write( "There are two ways to pick the vowel for the \"word\" to end in, A or I.\r\n" );
document.write( "\r\n" );
document.write( "Case 1. We pick the A for the \"word\" to end in.\r\n" );
document.write( "\r\n" );
document.write( "Then the letters to go before the A on the end are the distinguishable\r\n" );
document.write( "permutations of STTISTICS.  \r\n" );
document.write( "\r\n" );
document.write( "There are 3 indistinguishable S's,\r\n" );
document.write( "          3 indistinguishable T's, and \r\n" );
document.write( "          2 indistinguishable I's\r\n" );
document.write( "\r\n" );
document.write( "That's 9!/(3!3!2!) = 5040 ways.\r\n" );
document.write( "\r\n" );
document.write( "Case 2. We pick an I for the \"word\" to end in.\r\n" );
document.write( "\r\n" );
document.write( "Then the letters to go before the A on the end are the distinguishable\r\n" );
document.write( "permutations of STATSTICS.  \r\n" );
document.write( "\r\n" );
document.write( "There are 3 indistinguishable S's, and\r\n" );
document.write( "          3 indistinguishable T's \r\n" );
document.write( "          \r\n" );
document.write( "That's 9!/(3!3!) = 10080 ways.\r\n" );
document.write( "\r\n" );
document.write( "Grand total: 5040+10080 = 15120 ways.\r\n" );
document.write( "\r\n" );
document.write( "Edwin

\n" ); document.write( "

\n" );