document.write( "Question 463077: pls help... answer ASAP : \r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "a three digit code is made up of three diff. digts from the set (2,4,6,8,) . how many three digit codes can be formed if no digit can be repeated?... pls explain and show the solution......
\n" ); document.write( "

Algebra.Com's Answer #317360 by richard1234(7193)\"\" \"About 
You can put this solution on YOUR website!
There are four choices for the first digit, three for the second digit, and two for the third digit (this is so that no digits repeat). The number of ways is just 4P3 = 24. \n" ); document.write( "
\n" );