document.write( "Question 360323: If the letters of the word \" REGULATIONS \" be arranged at random, what is the chance that there will be exactly 4 letters between the R and the E \n" ); document.write( "
Algebra.Com's Answer #257132 by Theo(13342)![]() ![]() You can put this solution on YOUR website! the word is REGULATIONS\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "since there are 11 characters in the word, then those characters can be arranged in 11! = 39916800 ways randomly.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the number of ways that you can get 4 letters between any 2 specified letters are:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "?xxxx?xxxxx \n" ); document.write( "x?xxxx?xxxx \n" ); document.write( "xx?xxxx?xxx \n" ); document.write( "xxx?xxxx?xx \n" ); document.write( "xxxx?xxxx?x \n" ); document.write( "xxxxx?xxxx?\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "? represents the letters that have to have 4 letters between them. \n" ); document.write( "x represents the other letters.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "that's a total of 6 ways.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "if you wanted to solve this part of problem using a formula, you would need to consider the number of ways as follows:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "2 letters with 4 letters between them equals 1 block of 6 letters that have to be considered as 1 special letter because they are always together.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "you start with 11 letters. you have 1 block of 6 letters that needs to be considered as 1.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "subtract 6 from 11 and you get 5 remaining letters.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "your letters are B x x x x x\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "The B represents the block of 6 letters.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "The total possible ways this can happen is 6! / (1! * 5!) = 6! / 5! = 6.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Those possible ways are:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "B x x x x \n" ); document.write( "x B x x x \n" ); document.write( "x x B x x \n" ); document.write( "x x x B x \n" ); document.write( "x x x x B\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "if you look at the 6 ways that I showed you and you replace ?xxxx? with B, then you will see that the B represents ?xxxx?.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "So the number of ways that the pattern can present itself is 6.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the number of possible combinations in each one of those ways is:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "9! * 2! = 725760.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the number of possible combinatons in all 6 of those ways is therefore:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "6 * 9! * 2! = 6 * 725760 = 4354560\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the probability that will happen is therefore equal to 4354560 / 39916800 = .109090909\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "hard to see with big numbers so let's try smaller numbers:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "assume the word is MARK.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "what is the probability that the A and the K will always have 1 letter between them.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "total possible combinations in the word MARK equals 4! = 24.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "they are:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "MARK \n" ); document.write( "MAKR \n" ); document.write( "MRAK \n" ); document.write( "MRKA \n" ); document.write( "MKAR \n" ); document.write( "MKRA\r \n" ); document.write( "\n" ); document.write( "ARKM \n" ); document.write( "ARMK \n" ); document.write( "AKRM \n" ); document.write( "AKMR \n" ); document.write( "AMRK \n" ); document.write( "AMKR\r \n" ); document.write( "\n" ); document.write( "RMAK \n" ); document.write( "RMKA \n" ); document.write( "RAKM \n" ); document.write( "RAMK \n" ); document.write( "RKAM \n" ); document.write( "RKMA\r \n" ); document.write( "\n" ); document.write( "KMAR \n" ); document.write( "KMRA \n" ); document.write( "KAMR \n" ); document.write( "KARM \n" ); document.write( "KRMA \n" ); document.write( "KRAM\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "now restrict the letters so there is exactly 1 letter betweeen A and K.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "this can happen in 2 ways.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "they are:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "?x?x \n" ); document.write( "x?x?\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "? represents either A or K \n" ); document.write( "x represents either of the remaining letters.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "total possible combinations are therefore equal to 2 * 2! * 2! = 8.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "those possible combinations are:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "A and K are in the 2d and 4th positions.,\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "MARK \n" ); document.write( "MKRA \n" ); document.write( "RAMK \n" ); document.write( "RKMA\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "A and K are in the 1sd and 3d positions.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "AMKR \n" ); document.write( "KMAR \n" ); document.write( "ARKM \n" ); document.write( "KRAM\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "total number of possible ways is 4! = 24 \n" ); document.write( "total number of ways A and K can have exactly one letter between them is 2*2!*2! = 8.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "probability of that happening is 8 / 24 = 1/3.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "same concept only smaller numbers that can be shown easier.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "` \n" ); document.write( " |