Tutors Answer Your Questions about Permutations (FREE)
Question 1001499: A Discrete Mathematics student comes from the village of KILLYIKYAKYODLE. As an hilarious jape, on the way home from a late-night study session, she decides to rearrange the letters on one of the sign-posts.
How many arrangements of the letters in KILLYIKYAKYODLE are possible?
i got 15!/3!*2!*3!*2! for this
Of these arrangements, how many have all the L’s together?
Of these arrangements, how may have all the letters in alphabetical order?
Click here to see answer by KMST(5328)  |
Question 1001783: I run a golf pool. 150 pro golfers are listed and divided in 30 boxes of 5 players.
Each entrant must pick one player from each box (30 picks). We have 192 entrants playing the pool this year and two entrants have identical picks. What are the odds of that assuming no obvious bias for golfer ability?
Thanks,
Dave
Click here to see answer by solver91311(24713)  |
Question 1002016: Write the following expression without using the factorial symbol.
nC3 + nC2 + nC1
The formula given is n!/r!(n-r)!.
My teacher was saying the answer is n^3 + 5n/6.
Im very curious as to how the question is written in each step. I have tried many times to get an answer similiar to this. Thank you so much in advance!!
Click here to see answer by Boreal(15235)  |
Question 1002206: given 4 distinct objects, if 2 objects are taken at the time, the possible number combinations is equal 2. True or false?
*note: I used the combination formula nCr and I got 2. So "False." Just wanted to be sure if it was the right application I made. Thank you
Click here to see answer by Theo(13342)  |
Question 1003465: Suppose that 3 students who ride together miss a mathematics exam . they decided to lie to the instructor by saying that the car had a flat tire. the instructor separate the students and ask each of them which tire was flat . the students who did not anticipate this select their answers independently and at random . find the probability that the students get away with their deception?
Click here to see answer by fractalier(6550)  |
Question 1004398: Seven managers and eight sales representatives volunteer to attend a trade show. Their company can only afford to send five people. In how many ways could they be selected:
a) without any restrictions?
15C5 = 3003 ways
B) if there must be at least one manager and one sales representative chosen?
tried doing 7C1 = 7 + 8C1 = 8 + 13C3 = 286 but not the right answer
**answer should be 2926
Click here to see answer by stanbon(75887) |
Question 1004856: In a medical patients are classified in 8 ways according to whether they have blood type AB+, AB-, A+, A-, B+, B-, O+, O-, and also according to whether their blood pressure is low, normal or high. Find the number of ways in which a patient can be classified.
Click here to see answer by fractalier(6550)  |
Question 1004853: A drug for the relief of asthma can be purchased from 5 different manufacturers in liquid, tablet, or capsule form, all of which come in regular and extra strength. In how many different ways can a doctor prescribe the drug for a patient suffering from asthma?
Click here to see answer by fractalier(6550)  |
Question 1005536: A full house consists of three of one kind and two of another kind. You are dealt a hand of five cards from a standard deck of 52 playing cards. Find the probability of being dealt a full house consisting of three kings.
Click here to see answer by stanbon(75887) |
Question 1005636: seven boys and seven girls went to watch a movie how many ways can they be seated if
a. they arranged themselves in a row
b. the boys are sit together and so with the girls
c. the boys and the girls sit alternately
Click here to see answer by ikleyn(52776)  |
Question 1005929: In a certain city, there are four streets going north-south and seven streets going east-west. How many street paths start at the southwest corner of the city, end at the northeast corner of the city, and have the shortest possible length?
Click here to see answer by AnlytcPhil(1806)  |
Question 1005928: In a certain city, there are four streets going north-south and seven streets going east-west. How many street paths start at the southwest corner of the city, end at the northeast corner of the city, and have the shortest possible length?
Click here to see answer by AnlytcPhil(1806)  |
|
Older solutions: 1..45, 46..90, 91..135, 136..180, 181..225, 226..270, 271..315, 316..360, 361..405, 406..450, 451..495, 496..540, 541..585, 586..630, 631..675, 676..720, 721..765, 766..810, 811..855, 856..900, 901..945, 946..990, 991..1035, 1036..1080, 1081..1125, 1126..1170, 1171..1215, 1216..1260, 1261..1305, 1306..1350, 1351..1395, 1396..1440, 1441..1485, 1486..1530, 1531..1575, 1576..1620, 1621..1665, 1666..1710, 1711..1755, 1756..1800, 1801..1845, 1846..1890, 1891..1935, 1936..1980, 1981..2025, 2026..2070, 2071..2115, 2116..2160, 2161..2205, 2206..2250, 2251..2295, 2296..2340, 2341..2385, 2386..2430, 2431..2475, 2476..2520, 2521..2565, 2566..2610, 2611..2655, 2656..2700, 2701..2745, 2746..2790, 2791..2835, 2836..2880, 2881..2925, 2926..2970, 2971..3015, 3016..3060, 3061..3105, 3106..3150, 3151..3195, 3196..3240, 3241..3285, 3286..3330, 3331..3375, 3376..3420, 3421..3465, 3466..3510, 3511..3555, 3556..3600, 3601..3645, 3646..3690, 3691..3735, 3736..3780, 3781..3825, 3826..3870, 3871..3915, 3916..3960, 3961..4005, 4006..4050, 4051..4095, 4096..4140, 4141..4185, 4186..4230, 4231..4275, 4276..4320, 4321..4365, 4366..4410, 4411..4455, 4456..4500, 4501..4545, 4546..4590, 4591..4635, 4636..4680, 4681..4725, 4726..4770, 4771..4815, 4816..4860, 4861..4905, 4906..4950, 4951..4995, 4996..5040, 5041..5085, 5086..5130, 5131..5175, 5176..5220, 5221..5265, 5266..5310, 5311..5355, 5356..5400, 5401..5445, 5446..5490, 5491..5535, 5536..5580, 5581..5625, 5626..5670, 5671..5715, 5716..5760, 5761..5805, 5806..5850, 5851..5895, 5896..5940, 5941..5985, 5986..6030, 6031..6075, 6076..6120, 6121..6165, 6166..6210, 6211..6255, 6256..6300, 6301..6345, 6346..6390, 6391..6435, 6436..6480, 6481..6525, 6526..6570, 6571..6615, 6616..6660, 6661..6705, 6706..6750, 6751..6795, 6796..6840, 6841..6885, 6886..6930, 6931..6975, 6976..7020, 7021..7065, 7066..7110, 7111..7155, 7156..7200, 7201..7245, 7246..7290, 7291..7335, 7336..7380, 7381..7425, 7426..7470, 7471..7515, 7516..7560, 7561..7605, 7606..7650, 7651..7695, 7696..7740, 7741..7785, 7786..7830, 7831..7875, 7876..7920, 7921..7965, 7966..8010, 8011..8055, 8056..8100, 8101..8145, 8146..8190, 8191..8235, 8236..8280, 8281..8325, 8326..8370, 8371..8415, 8416..8460, 8461..8505, 8506..8550, 8551..8595, 8596..8640, 8641..8685, 8686..8730, 8731..8775, 8776..8820, 8821..8865, 8866..8910, 8911..8955, 8956..9000, 9001..9045, 9046..9090, 9091..9135, 9136..9180, 9181..9225, 9226..9270, 9271..9315, 9316..9360, 9361..9405, 9406..9450, 9451..9495, 9496..9540, 9541..9585, 9586..9630, 9631..9675, 9676..9720, 9721..9765, 9766..9810, 9811..9855, 9856..9900, 9901..9945, 9946..9990, 9991..10035
|