Five friends - Ross, Phoebe, Chandler, Joey, and Monica - decide to have lunch at a pizzeria. Five types of individual pizza are available: Hawaiian, Supreme, Veggie, Pepperoni, and Margherita. If Ross refuses to eat Hawaiian, Phoebe will only eat Margherita, and no two friends will eat the same type of pizza, in how many ways can they order lunch?
A. 18
B. 24
C. 48
D. 96
E. 120
[spoiler]OA=A[/spoiler]
Source: Veritas Prep
Five friends - Ross, Phoebe, Chandler, Joey, and Monica
This topic has expert replies
GMAT/MBA Expert
- Brent@GMATPrepNow
- 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
Take the task of feeding the 5 friends and break it into stages.M7MBA wrote:Five friends - Ross, Phoebe, Chandler, Joey, and Monica - decide to have lunch at a pizzeria. Five types of individual pizza are available: Hawaiian, Supreme, Veggie, Pepperoni, and Margherita. If Ross refuses to eat Hawaiian, Phoebe will only eat Margherita, and no two friends will eat the same type of pizza, in how many ways can they order lunch?
A. 18
B. 24
C. 48
D. 96
E. 120
[spoiler]OA=A[/spoiler]
Source: Veritas Prep
We'll begin with the most restrictive stage(s).
Stage 1: Select a pizza for Phoebe
Since Phoebe will only eat Margherita pizza, there's only 1 pizza we can serve her.
So, we can complete stage 1 in 1 way
Stage 2: Select a pizza for Ross
There are 4 pizzas remaining, but 1 of them is Hawaiian (which Ross refuses to eat).
So, there are only 3 pizzas we can serve Ross
We can complete stage 2 in 3 ways
Stage 3: Select a pizza for Chandler
There are 3 pizzas remaining, so we can complete stage 3 in 3 ways
Stage 4: Select a pizza for Joey
There are 2 pizzas remaining, so we can complete stage 4 in 2 ways
Stage 5: Select a pizza for Monica
There's only 1 pizza remaining, so we can complete stage 5 in 1 way
By the Fundamental Counting Principle (FCP), we can complete all 5 stages (and thus feed these "friends") in (1)(3)(3)(2)(1) ways (= 18 ways)
Answer: A
Note: the FCP can be used to solve the MAJORITY of counting questions on the GMAT. For more information about the FCP, watch our free 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