There are 20 chairs in a row. Find the number of ways of choosing 5 of these chairs, so that no two chosen chairs are adjacent.
Just for a starting reference. If I hoose any 5 chairs from 20 then the answer would be 20C5= 15504 ways
so any answer must be less than that.
Guests answer of 12376 passes that particular reasonable check but I would like him/her to expain much better how the answer was come by.
------------------------------------------------------
Here is my shot at this question.
Y stands for yes chosen
N stands for No not chosesn
*YN*YN*YN*YN*Y*
I interprete this as
Could be some chairs, yes gone, not gone, could be some chairs, etc
In order for 5 chairs to be yes chosen there must be at least 9 chairs altogether.
So it is the position of the other 11 chairs that is in question.
The possible position of the other 11 chairs are represented by the stars. There are 6 stars.
So my problem appears to have become. How many ways can I put split 11 chairs into 6 groups.
11 stars and 5 bars
11C5= 462 ways
I get 462 ways but it is quite likely wrong. My error, if there is one, could be trivial or it could be a complete failure in logic.
Rollingblade, do you have an answer of any kind?