Combinatorics Problem: Placing n Books with m Broken

  • Thread starter Thread starter lesdavies123
  • Start date Start date
  • Tags Tags
    Combinatorics
lesdavies123
Messages
16
Reaction score
0
Hi, just a simple combinatorics problem I can't figure out how to do!

We want to place n books, of which m are broken, on a bookshelf so that there are at least 2 consecutive broken books. The broken books are indissociable from one another and so are the good book, how many ways can we do this

Thank you in advance!
 
Physics news on Phys.org
lesdavies123 said:
Hi, just a simple combinatorics problem I can't figure out how to do!

We want to place n books, of which m are broken, on a bookshelf so that there are at least 2 consecutive broken books. The broken books are indissociable from one another and so are the good book, how many ways can we do this

Thank you in advance!
indissociable
What does this word mean? I suggest you rewrite the last sentence.
 
mathman said:
What does this word mean? I suggest you rewrite the last sentence.

I am sorry, I am French-Canadian and didnt know how to write this word in English (thought it was the same thing :P), I meant that the broken books are all exactly the same and can't be told apart from each other and so are the books in good condition!
 
Please clarify the original question. Do you mean any arrangement as long as at least two broken books are together? If m > (n+1)/2, all arrangements will work.
 
Ok I will rewrite it as an exact translation of the original question: We want to place n books, of which m are broken, on a shelf so that there are at least 2 consecutive broken books. The borken books cannot be told apart one from another, and that is also the case for the books in good condition. In how many ways can we do this?

Now this is a problem given to me by my teacher's assistant who doesn't explain as well as the teacher. She gave us the answer, but I can't figure out how she got to it, this is it

n!/(m!(n-m))! - ((n-m+1) choose m) or n!/(m!(n-m))! - (n-m+1)!/(m!(n-2m+1)!)

The only thing I know is that the +1 at the end of the second term is for if we placed a broken book at the edge of the shelf because she said this in class. Otherwise, isn't n choose m (the first term) the different ways to select m books from n, but what does that signify in this case as the m books will all be on the shelf anyways? So that's that thank you in advance!
 
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...
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...
Back
Top