document.write( "Question 1171413: How many 7-letter words can be made from the letters WASTEFUL if\r
\n" );
document.write( "\n" );
document.write( "repetition of letters is allowed? \r
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( "repetition of letters is not allowed? \n" );
document.write( "
Algebra.Com's Answer #850854 by ikleyn(52781)![]() ![]() You can put this solution on YOUR website! . \n" ); document.write( "How many 7-letter words can be made from the letters WASTEFUL if\r \n" ); document.write( "\n" ); document.write( "(a) repetition of letters is allowed? \r \n" ); document.write( "\n" ); document.write( "(b) repetition of letters is not allowed? \n" ); document.write( "~~~~~~~~~~~~~~~~~~~~~~~~~~\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \r\n" ); document.write( "The word WASTEFUL has 8 ubique letters, there is no repetition of letters.\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( "(a) In (a), in each of 7 position can be any of 8 letters, \r\n" ); document.write( " \r\n" ); document.write( " so the answer in this case is\r \n" ); document.write( "\n" ); document.write( "Solved.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |