nks2611 wrote:
abhimahna wrote:
She can visit the cities in any order. Number of ways of arranging the three cities is 3! = 6 ways. Hence B.
hi
abhi , although i got it right but can you please correct me where i am wrong , see it is mentioned that order does not matter here then the answer would be like
3!/2! that =3 and now she is coming back then same for this =3+3= 6 ways
please correct me where i am wrong , because you all guys are doing only 3! , which seems that order does matter here
thanks
Hi
nks2611 ,
No, your reasoning is not correct. We are given she visits each of the city
only once and then comes directly back to city C. So, your point "she is coming back then same for this =3" is incorrect as there will be only one way to reach each city.
So, we have the form of L,M,N and Last C.
No. of ways to arrange L,M and N when order doesn't matter = 3! = 6 ways.
Notice that C will remain as it is.
If I talk in your terms, "order does not matter here then the answer would be like
3!/2! that =3 ", it should not be 3P2 but it should be 3P1 as she is selecting one city out of 3 to go to and not 2 cities.
I hope that makes sense.
If not, reach out with your queries.
_________________
NEWCheck out our new tool - Executive Assessment Tests
My LinkedIn abhimahna. |
My GMAT Story: From V21 to V40 |
My MBA Journey: My 10 years long MBA DreamMy Secret Hacks: Best way to use GMATClub |
Importance of an Error Log!Verbal Resources: All SC Resources at one place |
All CR Resources at one placeGMAT Club Inbuilt Error Log Functionality - View More |
Best Reply Functionality on GMAT Club!New Visa Forum - Ask all your Visa Related Questions - here |
Have OPT questions? - Post them here.
Find a bug in the new email templates and get rewarded with 2 weeks of GMATClub Tests for freeCheck our new About Us Page here. |
Blog: Subscribe to Question of the Day BlogNew! Executive Assessment (EA) Exam - All you need to know!