Processing math: 100%
Rational Solver
0 votes
570 views
20 persons are sitting around a table. How many ways can we choose 3 persons, no two of whom are neighbours?
in Discrete Mathematics by Expert | 570 views

1 Answer

0 votes
Best answer

Have you tried this question? If not then do not see the answer, instead, first, try this beautiful problem and understand why 20×(203)×(2033) can't be the correct answer? This is not the correct answer as choosing the third person will depend on the sitting position of the second person. This indicates that we have to divide our answer into two parts depending on the seating position of the second person. 

Let us assume P1 , P2, and P3 are chosen tree person. Note that for the first person P1 we can choose any one of them and so for P1 we have total 20 choices. Now there are two way we can choose our second person P2

  1. P2 sits just 1 seat away from P1. In this case we will have only 2 options. 
  2. P2 sits more than 1 seat way from P1. In this case we can choose P2 in 205=15 ways. 

Now depending on the seating position of P2  we can choose our third-person P3:

  1. If P2 sits just 1 seat away from P1 then  P1 and P2 has a common neighbours. Therefore, P3 can't be P1, P2 and their neighbours. So for P3 we have 2023=15 choices. 
  2. If P2 sits more than 1 seat way from P1. In this case P3 can' be P1 or P2 or their immediate neighbours. So we can choose P3 in 2022×2=14 ways.

By applying the rule of sum and product, we get the total number of choices athat re  

(20×2×15)+(20×15×14)


Is the above answer is correct? No. because we are overcounting as our counts depend choice on people three-person on the order of choosing of the three person. That is we are counting the permutation without repetition. Therefore, a number of choices are (20×2×15)+(20×15×14)3=800.

by Expert
edited by
Welcome to Rational Solver, where you can ask questions and receive answers from other members of the community.
76 questions
33 answers
2 comments
1,801 users