document.write( "Question 1151702: Hello,
\n" );
document.write( "Given a sey of digits 1 to 9. 9 digit numbers are to be formed from the set without repetition. Find the possible number of ways of getting the digits 1 and 2 precede the digits 3 and 4. \n" );
document.write( "
Algebra.Com's Answer #773523 by greenestamps(13200)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "The number of 9-digit numbers using the digits 1-9 once each is 9!. \n" ); document.write( "The probability that the 1 precedes the 3 is 1/2. \n" ); document.write( "The probability that the 1 precedes the 4 is 1/2. \n" ); document.write( "The probability that the 2 precedes the 3 is 1/2. \n" ); document.write( "The probability that the 2 precedes the 4 is 1/2. \n" ); document.write( "The number of 9-digit numbers using the digits 1-9 once each, in which the 1 and 2 precede the 3 and 4, is \n" ); document.write( " \r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |