In how many ways can we select three numbers from the set A = { 1 , 3 , 5 , . . . , 1 9 } such that no two numbers have a difference of 2?
∗ For any a 1 , a 2 , a 3 that we selected ∣ a i − a j ∣ = 2
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
@Achmad Damanhuri , do you make your questions yourself ? From where do you get the idea ?
Most of them is mine, a few other i just peek it from somewhere after changing it a little. Mostly the idea came from the curiousity (question) of my student in my class, the way they asked made me see the problem from different perspective.
Oh , so you are a teacher. Your questions are great!
A B C ⟹ = { 1 , 3 , 5 , … , 1 9 } (Given) Divide A into 2 sets B and C such that, = { 1 , 5 , 9 , 1 3 , 1 7 } = { 3 , 7 , 1 1 , 1 5 , 1 9 } B and C are complementary sets under A The only way to pick a 1 , a 2 , a 3 so that ∣ a i − a j ∣ = 2 is, Case-1: When all 3 elements are picked from one of the sets B or C This can be done in 5 C 3 + 5 C 3 = 2 0 ways Case-2: When 1 element is picked from one of the sets and 2 from the other one. Since, ∣ a i − a j ∣ = 2 If an element is picked you cannot pick any of its neighbors in the original set A Also,an element and its neighbor cannot fall in the same set B or C 1 , 1 9 has only 1 neighbor in the complementary set. If 1 or 19 was chosen as the first element ,then There are 4 C 2 ways to choose the other 2 elements from the complementary set. Thus triples involving 1 or 19 as the first element can be chosen in 2 × 4 C 2 = 1 2 ways All elements other than1,19 has 2 neighbors in the complementary set. If one of the elements other than 1,19 was chosen as the first element ,then There are 3 C 2 ways to choose the remaining 2 elements from the complementary set. Thus triples not involving 1,19 as the first element can be chosen in 8 × 3 C 2 = 2 4 ways Thus the total number of ways for choosing 3 elements is given by, Number of ways = 2 0 + 1 2 + 2 4 = 5 6 ways
1 8 28 56 1 7 21 35 1 6 15 20 1 5 10 10 1 4 6 4 1 3 3 1 1 2 1 1 1
Problem Loading...
Note Loading...
Set Loading...
We change the prob to the correspondence prob such that, Let B = { 1 , 2 , 3 , . . . , 1 0 } we are going to select three number such that no two consecutive number. We will set the selected number a 1 < a 2 < a 3 ; 1 < a i < 1 0 but in this case there would be ( 1 , 2 , 3 ) , e t c . among the selected number. So we take b 1 = a 1 ; b 2 = a 2 + 1 ; b 3 = a 3 + 2 so that there are no two consecutive number. So now we can choose freely b 1 , b 2 , b 3 from 1 < b i < 8 The answer is C 3 8 = 5 6