document.write( "Question 901896: How many sets of 4-letter call letters are possible if:
\n" );
document.write( "The last two letters can be repeated?\r
\n" );
document.write( "
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( "The last two cannot be repeated?\r
\n" );
document.write( "\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #547091 by Fombitz(32388)![]() ![]() You can put this solution on YOUR website! Assuming the first two letters can be repeated. \n" ); document.write( "Last two repeated : \n" ); document.write( "Last two not repeated : \n" ); document.write( ". \n" ); document.write( ". \n" ); document.write( ". \n" ); document.write( "Assuming the first two letters cannot be repeated. \n" ); document.write( "Last two repeated : \n" ); document.write( "Last two not repeated : \n" ); document.write( " \n" ); document.write( " |