Jack is making a list of his 5 favorite cities. He will choose 3 cities

This topic has expert replies
Legendary Member
Posts: 1223
Joined: Sat Feb 15, 2020 2:23 pm
Followed by:1 members

Timer

00:00

Your Answer

A

B

C

D

E

Global Stats

Jack is making a list of his 5 favorite cities. He will choose 3 cities in the United States from a list of 5 candidates. He will choose 2 cities in Europe from a list of 3 candidates. How many different lists of cities, ranked from first to fifth, can Jack make?

A. 30
B. 360
C. 1,800
D. 3,600
E. 6,720

Answer: D
Source: Princeton Review
Source: — Problem Solving |

Senior | Next Rank: 100 Posts
Posts: 31
Joined: Fri Jul 24, 2020 9:40 pm
Choosing 3 cities out of 5=5c3 ways=10
Choosing 2 cities out of 3=3c2 ways=3
Arranging 5 cities =5! ways=120
Required ans=10*3*120=3600
Hence D.

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 16207
Joined: Mon Dec 08, 2008 6:26 pm
Location: Vancouver, BC
Thanked: 5254 times
Followed by:1268 members
GMAT Score:770
BTGModeratorVI wrote:
Sun Jul 26, 2020 6:38 am
Jack is making a list of his 5 favorite cities. He will choose 3 cities in the United States from a list of 5 candidates. He will choose 2 cities in Europe from a list of 3 candidates. How many different lists of cities, ranked from first to fifth, can Jack make?

A. 30
B. 360
C. 1,800
D. 3,600
E. 6,720

Answer: D
Source: Princeton Review
Take the task of creating a list and break it into stages.

Stage 1: Select 3 US cities
Since the order in which we SELECT the cities does not matter, we can use combinations.
We can select 3 cities from 5 cities in 5C3 ways (10 ways)
So, we can complete stage 1 in 10 ways

Stage 2: Select 2 European cities
Since the order in which we SELECT the cities does not matter, we can use combinations.
We can select 2 cities from 3 cities in 3C2 ways (3 ways)
So, we can complete stage 2 in 3 ways

Stage 3: Arrange the 5 selected cities
We can arrange n unique objects in n! ways.
So, we can arrange the 5 selected cities in 5! ways (120 ways)
We can complete this stage in 120 ways.

By the Fundamental Counting Principle (FCP), we can complete all 3 stages (and thus create our list) in (10)(3)(120) ways (= 3600 ways)

Answer: D

Note: the FCP can be used to solve the MAJORITY of counting questions on the GMAT. For more information about the FCP, watch this video: https://www.gmatprepnow.com/module/gmat- ... /video/775

You can also watch a demonstration of the FCP in action: https://www.gmatprepnow.com/module/gmat ... /video/776

Then you can try solving the following questions:

EASY
- https://www.beatthegmat.com/what-should- ... 67256.html
- https://www.beatthegmat.com/counting-pro ... 44302.html
- https://www.beatthegmat.com/picking-a-5- ... 73110.html
- https://www.beatthegmat.com/permutation- ... 57412.html
- https://www.beatthegmat.com/simple-one-t270061.html


MEDIUM
- https://www.beatthegmat.com/combinatoric ... 73194.html
- https://www.beatthegmat.com/arabian-hors ... 50703.html
- https://www.beatthegmat.com/sub-sets-pro ... 73337.html
- https://www.beatthegmat.com/combinatoric ... 73180.html
- https://www.beatthegmat.com/digits-numbers-t270127.html
- https://www.beatthegmat.com/doubt-on-sep ... 71047.html
- https://www.beatthegmat.com/combinatoric ... 67079.html


DIFFICULT
- https://www.beatthegmat.com/wonderful-p- ... 71001.html
- https://www.beatthegmat.com/permutation- ... 73915.html
- https://www.beatthegmat.com/permutation-t122873.html
- https://www.beatthegmat.com/no-two-ladie ... 75661.html
- https://www.beatthegmat.com/combinations-t123249.html


Cheers,
Brent
Brent Hanneson - Creator of GMATPrepNow.com
Image