- #1
lesdavies123
- 16
- 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!
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!