The Iceman wrote:s.pharmaco wrote:A man wants to visit at least two of the four cities A, B, C and D. how many travel itineries can he make? all cities are connected to one another.
Can somebody please explain why we need to use permutation here and not combination?
It's basically a problem on arrangements because order matters here.
First you can arrange all 4 cities. Then select three cities out of four and arrange those three cities. Lastly, select two out of the four and arrange those two cities.
4!+(4C3)*3!+4C2*2! = 60
You could also see this as 4P4 + 4P3 + 4P2, but it is easier to follow the convention using combination "C", given you are bale to apply the logic correctly.
I tried a different approach to solve this question, though its wrong but I want to understand why my approach is wrong here. Please help on that!
There are 4 cites,so for each city we have 2 options either 'Yes' or 'No' making the no. of ways available = 2x2x2x2 = 16
Now, we have to make itineraries picking at least 2 cities. This can be done by eliminating 1) Where we have 'No' in all the cities, there is only one way it can happen=1 2)Where only one city is not picked, this can happen in four ways [YYYN] [YYNY] [YNYY] [NYYY] =4.
Therefore, the no. of ways itineraries can be made picking at least two cities = 16-1-4=11.
What is wrong with my approach?