I Combination of Non Adjacent Numbers

Click For Summary
The discussion focuses on determining the number of ways to select four non-adjacent numbers from the set {1, 2, 3, 4, 5, 6, 7, 8}. The initial calculation suggests there are five combinations using the formula C(n-r+1,r), resulting in C(5,4)=5. However, upon verification, only four valid combinations are identified: 1,3,5,7; 1,3,5,8; 1,4,6,8; and 2,4,6,8. The participant is unsure about the missing fifth combination and proposes 1,3,6,8 as a potential candidate. The conversation highlights the challenge of accurately counting non-adjacent selections in combinatorial problems.
SamitC
Messages
36
Reaction score
0
Suppose there are numbers 1, 2, 3, 4, 5, 6, 7, 8. Question is: How many ways can we pick 4 non adjacent numbers (order does not matter)?
Now, as per formula it is C(n-r+1,r) = C(8-4+1,4) = C(5,4)=5.
Crosschecking, I could find only four: 1,3,5,7 : 1,3,5,8 : 1,4,6,8 : 2,4,6,8
Not sure which 5th one I am missing?
 
Physics news on Phys.org
1,3,6,8
 
Thanks.
 
Hello, I'm joining this forum to ask two questions which have nagged me for some time. They both are presumed obvious, yet don't make sense to me. Nobody will explain their positions, which is...uh...aka science. I also have a thread for the other question. But this one involves probability, known as the Monty Hall Problem. Please see any number of YouTube videos on this for an explanation, I'll leave it to them to explain it. I question the predicate of all those who answer this...
There is a nice little variation of the problem. The host says, after you have chosen the door, that you can change your guess, but to sweeten the deal, he says you can choose the two other doors, if you wish. This proposition is a no brainer, however before you are quick enough to accept it, the host opens one of the two doors and it is empty. In this version you really want to change your pick, but at the same time ask yourself is the host impartial and does that change anything. The host...

Similar threads