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 #317332 by Theo(13342) You can put this solution on YOUR website! the set of digits is 2,4,6,8\r \n" ); document.write( "\n" ); document.write( "you are taking a set of 3 out of a set of 4.\r \n" ); document.write( "\n" ); document.write( "if order is not important, then you are taking a combination of 3 out of 4.\r \n" ); document.write( "\n" ); document.write( "the formula for that is n! / (x! * (n-x)!)( which equals 4! / (1! * 3!) which becomes 4.\r \n" ); document.write( "\n" ); document.write( "if order is important, than you are taking a permutation of 3 out of 4.\r \n" ); document.write( "\n" ); document.write( "the formula for that is n! / (n-x)! which equals 4! / 1! which equals 24.\r \n" ); document.write( "\n" ); document.write( "the number of combinations is the number of sets that have at least one element different from any other set.\r \n" ); document.write( "\n" ); document.write( "your possible combinations are:\r \n" ); document.write( "\n" ); document.write( "246 \n" ); document.write( "248 \n" ); document.write( "268 \n" ); document.write( "468\r \n" ); document.write( "\n" ); document.write( "within each of these sets, you can make 6 arrangements by changing the order of each element in the set.\r \n" ); document.write( "\n" ); document.write( "example:\r \n" ); document.write( "\n" ); document.write( "246 possible arrangements are:\r \n" ); document.write( "\n" ); document.write( "246 \n" ); document.write( "264 \n" ); document.write( "426 \n" ); document.write( "462 \n" ); document.write( "624 \n" ); document.write( "642\r \n" ); document.write( "\n" ); document.write( "similarly you can do the same with with the other 3 sets.\r \n" ); document.write( "\n" ); document.write( "4 sets with 6 arrangements within each set gets you the 24 permutations.\r \n" ); document.write( "\n" ); document.write( "if the digits could be repeated, the formula would be changed as follows:\r \n" ); document.write( "\n" ); document.write( "you would have 4^3 possible arrangments which would be equal to 64 possible arrangements.\r \n" ); document.write( "\n" ); document.write( "the first number could be any of 2,4,6,8 \n" ); document.write( "the second number could be any of 2,4,6,8 \n" ); document.write( "the third number could be any of 2,4,6,8\r \n" ); document.write( "\n" ); document.write( "4 possible arrangments for each digit gets you the 4^3.\r \n" ); document.write( "\n" ); document.write( "examples would be:\r \n" ); document.write( "\n" ); document.write( "222 \n" ); document.write( "223 \n" ); document.write( "233 \n" ); document.write( "333 \n" ); document.write( "334 \n" ); document.write( "344 \n" ); document.write( "444 \n" ); document.write( "445 \n" ); document.write( "455 \n" ); document.write( "555 \n" ); document.write( "etc,\r \n" ); document.write( "\n" ); document.write( "showing you 64 possible arrangements is tedious.\r \n" ); document.write( "\n" ); document.write( "assume you had 3 numbers and you chose 2 out of 3.\r \n" ); document.write( "\n" ); document.write( "if the numbers could be repeated than you could have 3^2 = 9 possible arrangements\r \n" ); document.write( "\n" ); document.write( "let the numbers be 1, 2, 3, and the possible arrangements would be:\r \n" ); document.write( "\n" ); document.write( "11 \n" ); document.write( "12 \n" ); document.write( "13 \n" ); document.write( "21 \n" ); document.write( "22 \n" ); document.write( "23 \n" ); document.write( "31 \n" ); document.write( "32 \n" ); document.write( "33\r \n" ); document.write( "\n" ); document.write( "this assumes the same numbers can be used more than once.\r \n" ); document.write( "\n" ); document.write( "if the same numbers could not be used more than once, then the formulas shown above would apply.\r \n" ); document.write( "\n" ); document.write( "the number of combinations would be n! / (x! * (n-x)!) which would be equal to 3! / (2! * 1!) which would be equal to 6 / 2 which would be equal to 3.\r \n" ); document.write( "\n" ); document.write( "those combinations would be:\r \n" ); document.write( "\n" ); document.write( "12 \n" ); document.write( "13 \n" ); document.write( "23\r \n" ); document.write( "\n" ); document.write( "the number of permutations would be n! / (n-x)! which would be equal to 3! / 1! which would be equal to 6.\r \n" ); document.write( "\n" ); document.write( "those permutations would be:\r \n" ); document.write( "\n" ); document.write( "12 \n" ); document.write( "21 \n" ); document.write( "13 \n" ); document.write( "31 \n" ); document.write( "23 \n" ); document.write( "31\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "because the numbers were smaller, i could show you the details of how this works out.\r \n" ); document.write( "\n" ); document.write( "in your problem, the answer is:\r \n" ); document.write( "\n" ); document.write( "number of combinations equals 4! / (3! * 1!) = 4\r \n" ); document.write( "\n" ); document.write( "number of permutations equals 4! / (1!) = 4 * 3 * 2 = 24\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |