Bunuel
List S = {1, 2, 4, 5, 7, 8}
What is the number of non-empty subsets of list S possible such that a subset does not contain consecutive numbers?
(A) 77
(B) 48
(C) 36
(D) 32
(E) 26
Let us checks sets by the number of elements
(1)
Single element: any one of the six elements in a set, so 6 sets
(2)
Two elements: Any one from two of {1,2}, {4,5} and {7,8}. So 2*2*3C2=12
(3)
Three elements: One from each of {1,2}, {4,5} and {7,8}. So 2*2*2=8
The moment we have 4 elements, at least one of {1,2}, {4,5} and {7,8} will have both the elements. Thus, there will surely be some consecutive numbers : {1,4,7, X}. X can be 2, 5 or 8, and each one of them will result in a pair of consecutive numbers.
Total = 6+12+8=26
E
we need to fill 3 places so first can be filled in 6 ways, second in 4 ways( because we will exclude the number which is the consecutive number of the first selected number) and the third place in 2 ways( same reason) so no of ways we can have a set of 3 elements is 6*4*2=48?