MGMAT Combinatorics Probem Sets

This topic has expert replies
Master | Next Rank: 500 Posts
Posts: 116
Joined: Wed Oct 03, 2012 10:44 pm
Thanked: 5 times
Followed by:1 members

MGMAT Combinatorics Probem Sets

by theachiever » Tue Oct 30, 2012 10:48 pm
Problem Set

A delegation from City A goes to City B to discuss a limited X-Y Combination Partnership.If the Mayor of City B chooses 3 members of the 7 person delegation to meet with Y ,how many different 3-person combinations can he choose?
Source: — Problem Solving |

Legendary Member
Posts: 1084
Joined: Fri Apr 15, 2011 2:33 pm
Thanked: 158 times
Followed by:21 members

by pemdas » Tue Oct 30, 2012 11:30 pm
theachiever wrote:Problem Set

A delegation from City A goes to City B to discuss a limited X-Y Combination Partnership.If the Mayor of City B chooses 3 members of the 7 person delegation to meet with Y ,how many different 3-person combinations can he choose?
7C3=7!/(4!*3!)=35 ways
Success doesn't come overnight!

Master | Next Rank: 500 Posts
Posts: 116
Joined: Wed Oct 03, 2012 10:44 pm
Thanked: 5 times
Followed by:1 members

by theachiever » Tue Oct 30, 2012 11:35 pm
2.A Spy of a certain country X is trying to escape from his prison cell.The lock requires him to enter one number, from 1-9,and then push a pair of colored buttons simultaneously.He can make one attempt every 3 seconds.If there are 6 colored buttons,what is the longest possible time it could take the spy to escape from prison cell?

Legendary Member
Posts: 1084
Joined: Fri Apr 15, 2011 2:33 pm
Thanked: 158 times
Followed by:21 members

by pemdas » Wed Oct 31, 2012 2:31 am
theachiever wrote:2.A Spy of a certain country X is trying to escape from his prison cell.The lock requires him to enter one number, from 1-9,and then push a pair of colored buttons simultaneously.He can make one attempt every 3 seconds.If there are 6 colored buttons,what is the longest possible time it could take the spy to escape from prison cell?
all options include 9 numbers entered combined with a pair of two buttons pressed simultaneously out of six (order doesn't matter) 6C2 Or 9*6C2=135 attempts in total. Considering for each attempt a Spy spends 3 seconds makes the longest time 135*3/60=135/20=6 3/4 Or 6 minutes and 45 seconds.
Success doesn't come overnight!

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

by Brent@GMATPrepNow » Wed Oct 31, 2012 6:33 am
Please post only one question per thread. Otherwise things can get complicated if there are discussions on multiple questions.

Cheers,
Brent

PS: If anyone is interested, we have a free video on calculating combinations (like 7C3) in your head: https://www.gmatprepnow.com/module/gmat-counting?id=789
Brent Hanneson - Creator of GMATPrepNow.com
Image