Last visit was: 28 Mar 2025, 08:53 It is currently 28 Mar 2025, 08:53
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
rishi02
Joined: 21 Sep 2015
Last visit: 06 Jan 2025
Posts: 86
Own Kudos:
497
 [15]
Given Kudos: 403
Location: India
GMAT 1: 730 Q48 V42
GMAT 2: 750 Q50 V41
GMAT 3: 760 Q49 V46
Products:
GMAT 3: 760 Q49 V46
Posts: 86
Kudos: 497
 [15]
4
Kudos
Add Kudos
11
Bookmarks
Bookmark this Post
User avatar
abhimahna
User avatar
Board of Directors
Joined: 18 Jul 2015
Last visit: 06 Jul 2024
Posts: 3,551
Own Kudos:
5,646
 [3]
Given Kudos: 346
Status:Emory Goizueta Alum
Products:
Expert
Expert reply
Posts: 3,551
Kudos: 5,646
 [3]
1
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
User avatar
paidlukkha
Joined: 11 Nov 2014
Last visit: 21 Apr 2017
Posts: 261
Own Kudos:
352
 [3]
Given Kudos: 17
Location: India
Concentration: Finance, International Business
WE:Project Management (Telecommunications)
2
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
User avatar
law258
Joined: 05 Sep 2016
Last visit: 11 Oct 2020
Posts: 264
Own Kudos:
Given Kudos: 283
Status:DONE!
Posts: 264
Kudos: 110
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Question is asking for order --> means permutation is needed

Hence, 3x2x1 = 6
User avatar
Abhishek009
User avatar
Board of Directors
Joined: 11 Jun 2011
Last visit: 16 Dec 2024
Posts: 5,997
Own Kudos:
5,063
 [2]
Given Kudos: 463
Status:QA & VA Forum Moderator
Location: India
GPA: 3.5
WE:Business Development (Commercial Banking)
Posts: 5,997
Kudos: 5,063
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
rishi02
Jill, who lives in City C, plans to visit 3 different cities, M, L, and S. She plans to visit each city exactly once and return to City C after the 3 visits. She can visit the cities in any order. In how many different orders can she visit the 3 cities?

(A) 3
(B) 6
(C) 8
(D) 9
(E) 12
Attachment:
Untitled.png
Untitled.png [ 2.39 KiB | Viewed 19675 times ]
No of ways Jill can visit the cities and returns is 3*2*1 => 6 ways...

Hence answer will be (B) 6
User avatar
nks2611
Joined: 24 Oct 2016
Last visit: 06 Apr 2020
Posts: 191
Own Kudos:
70
 [1]
Given Kudos: 89
Location: India
Concentration: Finance, International Business
Schools: IIMB
GMAT 1: 550 Q42 V28
GPA: 3.96
WE:Human Resources (Retail Banking)
Schools: IIMB
GMAT 1: 550 Q42 V28
Posts: 191
Kudos: 70
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
abhimahna
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 :roll:

thanks
User avatar
abhimahna
User avatar
Board of Directors
Joined: 18 Jul 2015
Last visit: 06 Jul 2024
Posts: 3,551
Own Kudos:
5,646
 [1]
Given Kudos: 346
Status:Emory Goizueta Alum
Products:
Expert
Expert reply
Posts: 3,551
Kudos: 5,646
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
nks2611
abhimahna
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 :roll:

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.
User avatar
nks2611
Joined: 24 Oct 2016
Last visit: 06 Apr 2020
Posts: 191
Own Kudos:
Given Kudos: 89
Location: India
Concentration: Finance, International Business
Schools: IIMB
GMAT 1: 550 Q42 V28
GPA: 3.96
WE:Human Resources (Retail Banking)
Schools: IIMB
GMAT 1: 550 Q42 V28
Posts: 191
Kudos: 70
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thank very much abhi i got my mistake, here she can travel from c to any other citu for once so the order can be difffernt for this so total ways should be 6 ways

Sent from my vivo 1601 using GMAT Club Forum mobile app
avatar
sujith099
Joined: 16 Apr 2017
Last visit: 06 Nov 2018
Posts: 1
Given Kudos: 1
Posts: 1
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
The question says---Jill, who lives in City C, plans to visit 3 different cities, M, L, and S. She plans to visit each city exactly once and return to City C after the 3 visits.

Thus it is very clear that jill comes back to C after 3 city visits.We need to count C in one of these 3 city visits.

C
- - - = considering M,L and S in first 2 places(3P2) and C in its last place(1!)--->total number of arrangements=3P2*1!=6

Hope this approach is right.

--Sujith
User avatar
gmatzpractice
Joined: 07 Feb 2017
Last visit: 25 Nov 2024
Posts: 128
Own Kudos:
Given Kudos: 11
GMAT 1: 710 Q48 V40
GMAT 1: 710 Q48 V40
Posts: 128
Kudos: 74
Kudos
Add Kudos
Bookmarks
Bookmark this Post
6 orderings

C MLS C
C MSL C
C LSM C
C LMS C
C SLM C
C SML C
User avatar
CrushTheQuant
Joined: 02 Nov 2020
Last visit: 18 Jan 2021
Posts: 26
Own Kudos:
Given Kudos: 1
Posts: 26
Kudos: 7
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Since we care about the order in which Jill visits the cities, this is a permutations question.

Here's an explanation of this question on YouTube:

https://www.youtube.com/watch?v=U1V029s ... rjxKZWMPuo

Note that if we didn't care about the order - if this were a combinations question - the answer would just be 1!
avatar
JCGF2021
Joined: 11 Jan 2021
Last visit: 24 Aug 2022
Posts: 9
Own Kudos:
Given Kudos: 20
Posts: 9
Kudos: 2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hello,

Can someone explain this question using the permutation formula P(n,r)= n¡/(n-r)¡. thanks a lot.
avatar
Adannaya
Joined: 12 Mar 2018
Last visit: 15 Mar 2023
Posts: 1
Given Kudos: 10
Posts: 1
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
I thought of the journey as a circular one. Therefore (n-1)! is (4-1)! = 6
User avatar
saynchalk
Joined: 17 Sep 2023
Last visit: 28 March 2025
Posts: 180
Own Kudos:
Given Kudos: 695
Status:Always questioning myself
Location: India
Concentration: General Management, International Business
Schools: CBS
GMAT Focus 1: 525 Q74 V82 DI72
GPA: 3.1
WE:Sales (Computer Software)
Schools: CBS
GMAT Focus 1: 525 Q74 V82 DI72
Posts: 180
Kudos: 151
Kudos
Add Kudos
Bookmarks
Bookmark this Post
JCGF2021
Hello,

Can someone explain this question using the permutation formula P(n,r)= n¡/(n-r)¡. thanks a lot.
­hey, sorry but I didn't understand the Permutation method, but basically, there are 3 cities she will visit whose orders can be anything

so the number of possible ways is 3! = 3*2*1 = 6
Moderators:
Math Expert
100137 posts
PS Forum Moderator
522 posts