Permutations and arranging order

  • Thread starter Thread starter Pavel
  • Start date Start date
  • Tags Tags
    Permutations
Pavel
Messages
83
Reaction score
0
Hi, I was answering what I thought was an easy problem and I got it wrong, but not sure why. Please give me an insight.

Problem: 12 juniors are ordered (in a line) for a drill. What's the probability (assuming all arrangments are random) of Dave standing next to Beth?

My reasoning: There are 12! possible arrangments of juniors. The number of arrangments where Dave is next to Beth is 2 (number of ways Beth can stand next to Dave, DB - BD) multiply by all possible arrangments for the remaning juniors, i.e. 10!. So, the probability is then 2x10! / 12!.

Well, that's wrong - 2 must be multiplied by 11!, not 10!, but I don't understand why - there are 10 juniors left to be ordered in any way to be combined with Beth and Dave. I realize that if I write it out on a paper, I'll count 11! of them. But I don't want to simply memorize the formula for this type of problem, I want understand the reasoning. Why 11! ?

Thanks,

Pavel.
 
Physics news on Phys.org
You have to tell Beth where to stand before you place David next to her.
 
There are 10! ways for the others to line up, and thus 10! ways for Dave to be first, Beth second, and everyone else in some order behind them. If Dave and Beth can be in any order that is 2*10! ways. But Dave and Beth don't have to be together at the front of the line -- they could be anywhere. There are 2*10! ways there could be one person in front of the two (and 9 behind), 2*10! that there are two people in front of them, etc., for a total of 11 * (2 * 10!) ways, or 2 * 11! ways.

Edit: or what EnumaElish said.
 
OK, so you have 2 ways for Beth to stand next to Dave, BD and DB, and thus have 10! ways of arranging the remaining children. However, there are 11 ways of arranging the combination of Beth and Dave amongst the other children. So, there are 2*11*10! ways of arranging the children so that B and D are next to one another.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top