Combinatorics Problem: Placing n Books with m Broken

  • Context: Undergrad 
  • Thread starter Thread starter lesdavies123
  • Start date Start date
  • Tags Tags
    Combinatorics
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
4 replies · 2K views
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!
 
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!
 
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!