Solving a Combinatorial Problem: Arrangements with Restrictions

  • Thread starter Thread starter Nathew
  • Start date Start date
  • Tags Tags
    Probability
Nathew
If we have the letters A, B, C, D, E, and F, and we are asked to find the number of arrangements where A is before B, wouldn't this just be half of the total number of arrangements with no restrictions? Intuitively this makes sense, but I have some doubts. For example, when I try to do the problem out, I get 2(5!)+2(4!)(2!)+(3!)(3!) which is slightly over half of the total arrangements with no restrictions.

Help me out please!
 
Physics news on Phys.org
Try it for a smaller number of letters so that you can write out all the possibilities.
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
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...
Back
Top