document.write( "Question 1084227: How many different 5-letter sequences can be made using the first 11 letters of the alphabet? Assume that repetition of letters is allowed.\r
\n" ); document.write( "\n" ); document.write( "A.) 55,440
\n" ); document.write( "B) 161,051
\n" ); document.write( "C) 462
\n" ); document.write( "D) 120 \n" ); document.write( "

Algebra.Com's Answer #698315 by ikleyn(52781) $\"\"$ $\"About$

You can put this solution on YOUR website!
.
\n" ); document.write( "

\r\n" );
document.write( " = 161051.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Option B).\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Any of 11 letters in  the first position gives 11 options.\r\n" );
document.write( "\r\n" );
document.write( "Any of 11 letters in  the second position gives 11 independent options.\r\n" );
document.write( "\r\n" );
document.write( ". . . and so on . . . \r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "In all, it gives   = 161051 5-letter words.\r\n" );
document.write( "

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

\n" );