document.write( "Question 1111291: When testing for current in a cable with eight color-coded wires, the author used a meter to test three wires at a time. How many different tests are required for every possible pairing of three wires? \n" ); document.write( "
Algebra.Com's Answer #726312 by Theo(13342) You can put this solution on YOUR website! you would use the combination formula of:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "c(n,x) = n! / (x! * (n-x)!)\r \n" ); document.write( "\n" ); document.write( "n = 8 \n" ); document.write( "x = 3\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "formula becomes c(8,3) = 8! / (3! * 5!)\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "result is c(8,3) = 56 different test would be required to get all possible combinations of 3 wires each, where order within each set of 3 is not important.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "to see how this works, make n smaller so the number of possible combinations will be less.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "when n = 4, c(4,3) = 4\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "let the wires be a, b, c, and d.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the test required to make sure you got all possible combinations would be:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "abc \n" ); document.write( "abd \n" ); document.write( "acd \n" ); document.write( "bcd\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "note that the combination formula assumes order is not important within each set of 3.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "if order is important, then the permutation formula would be used.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "that formula is p(n,x) = n! / (n-x)!\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "note that the x! in the denominator is missing in the permutation formula, while it is present in the combination formula.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the x! in the denominator is the one that takes away the order is important part. \n" ); document.write( "that's what turns the permutation formula into the combination formula.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the number of possible permutations with p(4,3) is 4! / (4 - 3)! = 4! / 1! = 24\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "those permutations would be:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "abc ***** original \n" ); document.write( "acb \n" ); document.write( "bac \n" ); document.write( "bca \n" ); document.write( "cab \n" ); document.write( "cba\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "abd ***** original \n" ); document.write( "adb \n" ); document.write( "bad \n" ); document.write( "bda \n" ); document.write( "dab \n" ); document.write( "dba\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "acd ***** original \n" ); document.write( "adc \n" ); document.write( "cad \n" ); document.write( "cda \n" ); document.write( "dac \n" ); document.write( "dca\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "bcd ***** original \n" ); document.write( "bdc \n" ); document.write( "cbd \n" ); document.write( "cdb \n" ); document.write( "dbc \n" ); document.write( "dcb\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "out of the 24 possible permutations, there are only 4 possible combinations.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "note that, for each of the originals that were derived from the combination formula, there are 6 possible permutations.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "3! = 6, which is where the x! in the denominator comes from in the combination formula.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "c(n,x) = n! / (x! * (n-x)!) becomes c(4,3) = 4! / (3! * (4-3)!) which becomes c(4,3) = 4! / (3! * 1!) = 4\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "p(n,x) = n! / (n-x)! becomes p(4,3) = 4! / (4-3)! which becomes p(4,3) = 4! / 1! = 24\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "bottom line:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "you have 8 wires and you want to test all possible combinations of 3 of these at a time.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "order, or arrangement of the wires within each set of 3 is not important, therefore you use the combination formula and not the permutations formula.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "c(8,3) = 8! / (3! * 5!) = 56 possible sets of 3 wires where order within each set of 3 is not important.\r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |