document.write( "Question 1135152: How many different five-letter strings can be formed from the letters A, B, C, D, E (repeats allowed) if the first letter must be a vowel and the last letter must be a consonant?
\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #752747 by greenestamps(13203)\"\" \"About 
You can put this solution on YOUR website!


\n" ); document.write( "1st letter: must be a vowel -- 2 choices
\n" ); document.write( "2nd letter: no restrictions -- 5 choices
\n" ); document.write( "3rd letter: no restrictions -- 5 choices
\n" ); document.write( "4th letter: no restrictions -- 5 choices
\n" ); document.write( "5th letter: most be a consonant -- 3 choices

\n" ); document.write( "By the fundamental counting principle, the total number of 5-letter strings is the product of the numbers of choices you have for each letter:

\n" ); document.write( "2*5*5*5*3 = 750
\n" ); document.write( "
\n" );