Hi, just a simple combinatorics problem I cant figure out how to do!(adsbygoogle = window.adsbygoogle || []).push({});

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 Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Combinatorics problem

**Physics Forums | Science Articles, Homework Help, Discussion**