eleven boxes have been arranged in a row. eight rabits are to be placed in eight of them so that no two rabbits occupy the same box. find the number of ways this can be done if no two empty boxes are adjacent. answer is 8! C(9,3) can someone explain? i can't understand why!! :( especially where the C(9,3) came from...
MAY HELP U.... http://www.themathpage.com/aprecalc/permutations-combinations-2.htm
i need help with the question itself. :(
@jim_thompson5910 @saifoo.khan @Hero @ParthKohli ? help please:(
@saifoo.khan if you notice, i asked that question too! but the answer @dumbcow isn't the same with the book O: :(
Ops. My bad. Sorry.
@nevershoutnever_97 that answer came from @dumbcow in my previous post with the same question and again, it's not the same with the book...
better leave that model...n do as u`ve studied...
*bookmark
the answer u provided is wrong mister whatever.. just go in details of combinations it is clear qustion
@khurramshahzad really? it came from the book :( well i don't understand it either
okay man ,... but it does`t make any sense to me
is it really \(8! C(9,3)\)? 'cause i get \(8! C(10,3)\)
@sirm3d yup :( how did you get C(10,3)?
Join our real-time social learning platform and learn together with your friends!