Question
Question: No. Of ways to select 5 people out of 12 people such that no two are consecutive...
No. Of ways to select 5 people out of 12 people such that no two are consecutive
56
Solution
To select 5 people out of 12 such that no two are consecutive, we can use a standard combinatorial technique.
Let the 12 people be arranged in a row. Let n=12 be the total number of people and k=5 be the number of people to be selected.
Method 1: Using the transformation technique
Let the positions of the 5 selected people be x1,x2,x3,x4,x5, such that 1≤x1<x2<x3<x4<x5≤12. The condition that no two people are consecutive means that the difference between the positions of any two selected people must be at least 2. So, xi+1−xi≥2 for i=1,2,3,4.
Let's define a new set of variables yi:
y1=x1
y2=x2−1
y3=x3−2
y4=x4−3
y5=x5−4
Now, let's check the conditions for yi:
- y1≥1 (since x1≥1)
- y2=x2−1≥(x1+2)−1=x1+1=y1+1. So, y2>y1.
- Similarly, y3>y2, y4>y3, and y5>y4.
So, we have 1≤y1<y2<y3<y4<y5.
What is the upper bound for y5?
y5=x5−4≤12−4=8.
Thus, we need to choose 5 distinct numbers (y1,y2,y3,y4,y5) from the set {1,2,3,4,5,6,7,8}. The number of ways to do this is given by the combination formula (km), where m is the total number of available choices (8 in this case) and k is the number of items to choose (5 in this case).
Number of ways = (58)
Method 2: Using the gaps method
Imagine the n−k unselected people are placed first. Number of unselected people = 12−5=7. Let's represent the unselected people by 'U':
U U U U U U U
These 7 unselected people create 7+1=8 possible positions (gaps) where the 5 selected people can be placed.
_ U _ U _ U _ U _ U _ U _ U _
To ensure no two selected people are consecutive, each selected person must be placed in a different gap. We need to choose 5 of these 8 available gaps for the 5 selected people.
The number of ways to choose 5 gaps out of 8 is (58).
Calculation:
(58)=(8−58)=(38)
(38)=3×2×18×7×6=6336=56
So, there are 56 ways to select 5 people out of 12 such that no two are consecutive.
General Formula:
For selecting k items from n items arranged in a row such that no two are consecutive, the number of ways is (kn−k+1).
In this problem, n=12 and k=5.
Number of ways = (512−5+1)=(58)=56.
Explanation of the solution:
To select k people from n arranged in a row such that no two are consecutive, imagine placing the n−k unselected people first. These n−k people create n−k+1 possible slots where the k selected people can be placed. Since no two selected people can be consecutive, each selected person must occupy a unique slot. Thus, the problem reduces to choosing k slots out of n−k+1 available slots. For n=12 and k=5, this is (512−5+1)=(58)=56.