It is currently 21 Oct 2017, 08:43

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# A British spy is trying to escapre from the prison cell.

Author Message
TAGS:

### Hide Tags

Senior Manager
Joined: 03 Nov 2005
Posts: 380

Kudos [?]: 68 [0], given: 17

Location: Chicago, IL
A British spy is trying to escapre from the prison cell. [#permalink]

### Show Tags

24 Oct 2009, 22:54
1
This post was
BOOKMARKED
00:00

Difficulty:

(N/A)

Question Stats:

100% (01:25) correct 0% (00:00) wrong based on 6 sessions

### HideShow timer Statistics

A British spy is trying to escapre from the prison cell. The lock code requires him to enter one number, from 1 to 9, and then push a pair of colored buttons simultaneously. Threre are a total of 6 colored buttons. He can make 1 attempt every 3 seconds. What is the longest possible time it may take him to escape from the cell.
_________________

Hard work is the main determinant of success

Kudos [?]: 68 [0], given: 17

Math Expert
Joined: 02 Sep 2009
Posts: 41889

Kudos [?]: 129110 [2], given: 12194

### Show Tags

24 Oct 2009, 23:14
2
KUDOS
Expert's post
rlevochkin wrote:
A British spy is trying to escapre from the prison cell. The lock code requires him to enter one number, from 1 to 9, and then push a pair of colored buttons simultaneously. Threre are a total of 6 colored buttons. He can make 1 attempt every 3 seconds. What is the longest possible time it may take him to escape from the cell.

9C1(numbers)*6C2(buttons)*3sec(time)=9*15*3=405sec
_________________

Kudos [?]: 129110 [2], given: 12194

SVP
Joined: 29 Aug 2007
Posts: 2472

Kudos [?]: 843 [0], given: 19

### Show Tags

24 Oct 2009, 23:47
rlevochkin wrote:
A British spy is trying to escapre from the prison cell. The lock code requires him to enter one number, from 1 to 9, and then push a pair of colored buttons simultaneously. Threre are a total of 6 colored buttons. He can make 1 attempt every 3 seconds. What is the longest possible time it may take him to escape from the cell.

= 9c1 x 2 (6c2) x 3 sec, or, = 9c1 x (6x5) x 3 sec ..... order matters.
= 9 x 2 (15) x 3 sec
= 810 second
_________________

Gmat: http://gmatclub.com/forum/everything-you-need-to-prepare-for-the-gmat-revised-77983.html

GT

Kudos [?]: 843 [0], given: 19

Senior Manager
Joined: 03 Nov 2005
Posts: 380

Kudos [?]: 68 [0], given: 17

Location: Chicago, IL

### Show Tags

24 Oct 2009, 23:56
The order does not matter because the buttons are pressed simultaneously vs. one at a time
_________________

Hard work is the main determinant of success

Kudos [?]: 68 [0], given: 17

Math Expert
Joined: 02 Sep 2009
Posts: 41889

Kudos [?]: 129110 [0], given: 12194

### Show Tags

24 Oct 2009, 23:59
GMAT TIGER do you mean the order he pushes the two buttons matter?

Maybe I didn't understand the stem correctly but ".. push a pair of colored buttons simultaneously". Doesn't that mean that the order doesn't matter? He pushes two at a time, simultaneously. I got it like there are no button 1 and 2.
_________________

Kudos [?]: 129110 [0], given: 12194

SVP
Joined: 29 Aug 2007
Posts: 2472

Kudos [?]: 843 [0], given: 19

### Show Tags

25 Oct 2009, 00:09
Bunuel wrote:
GMAT TIGER do you mean the order he pushes the two buttons matter?

Maybe I didn't understand the stem correctly but ".. push a pair of colored buttons simultaneously". Doesn't that mean that the order doesn't matter? He pushes two at a time, simultaneously. I got it like there are no button 1 and 2.

Probably I did not understand the question on the pair of colored buttons.

I assumed that if it is a code, then probably how you press the colored buttons "red and black" matters. If these colored buttons are seperately placed, then still it matters. If the two buttons are placed simulteneously and can be pressed at a time, then the order doesnot matter.

However it seems the order doesnot mattter per the originator's post.
_________________

Gmat: http://gmatclub.com/forum/everything-you-need-to-prepare-for-the-gmat-revised-77983.html

GT

Kudos [?]: 843 [0], given: 19

Manager
Joined: 16 Jul 2009
Posts: 248

Kudos [?]: 440 [0], given: 3

### Show Tags

25 Oct 2009, 01:34
I get 405sec going by bunnel's method..

Kudos [?]: 440 [0], given: 3

Intern
Joined: 26 Oct 2009
Posts: 15

Kudos [?]: 4 [0], given: 0

### Show Tags

02 Nov 2009, 13:47
I got 405s, but I'm pretty certain that the spy is boned.

Kudos [?]: 4 [0], given: 0

Manager
Joined: 25 Aug 2009
Posts: 164

Kudos [?]: 201 [2], given: 3

Location: Streamwood IL
Schools: Kellogg(Evening),Booth (Evening)
WE 1: 5 Years

### Show Tags

02 Nov 2009, 14:38
2
KUDOS
Second thought-
Should we start counting the time from t+3 instead of t.
you need to count the time between the attempts and not the attempts itself -
i.e 1 st attempt 0 secs
2 nd attempt 3 secs
9C1*6C2 attempt (9C1*6C2 -1)*3 = 402 seconds.

The question says "He can make 1 attempt every 3 seconds" which could mean he needs to wait 3 seconds before making the first attempt (Kinda dumb IMO).

Anyhow I won't be surprised if the answer is 405 but for similar questions I would watch what is asked for very closely to rule out the possibility of a 402.
_________________

Rock On

Kudos [?]: 201 [2], given: 3

Intern
Joined: 05 Oct 2010
Posts: 13

Kudos [?]: [0], given: 19

### Show Tags

28 Jul 2011, 12:30
Sudhanshuacharya wrote:
A British spy 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 the prison cell?

9 x 15 (there are 135 combinations) x 3 (one attempt per 3 seconds) = 405 seconds

Kudos [?]: [0], given: 19

Manager
Joined: 31 May 2011
Posts: 85

Kudos [?]: 65 [0], given: 4

Location: India
GMAT Date: 12-07-2011
GPA: 3.22
WE: Information Technology (Computer Software)

### Show Tags

28 Jul 2011, 12:46
katealpha wrote:
Sudhanshuacharya wrote:
A British spy 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 the prison cell?

9 x 15 (there are 135 combinations) x 3 (one attempt per 3 seconds) = 405 seconds

I guess you arrived at 15 by doing 6C2.
So if there are 6 different colors then: is 4, greeen, red combination same as 4, red, green???

Kudos [?]: 65 [0], given: 4

Intern
Joined: 27 Feb 2011
Posts: 45

Kudos [?]: 4 [0], given: 9

### Show Tags

28 Jul 2011, 12:52
Sudhanshuacharya wrote:
katealpha wrote:
Sudhanshuacharya wrote:

So if there are 6 different colors then: is 4, greeen, red combination same as 4, red, green???

Could you pls explain this, sounds interesting..

Kudos [?]: 4 [0], given: 9

Intern
Joined: 05 Oct 2010
Posts: 13

Kudos [?]: [0], given: 19

### Show Tags

28 Jul 2011, 13:03
So if there are 6 different colors then: is 4, greeen, red combination same as 4, red, green???[/quote][/quote][/quote]

Could you pls explain this, sounds interesting..[/quote]

Since he pushes the buttons SIMULTANEOUSLY #4 green, red combination is exactly the same as #4 red green

Kudos [?]: [0], given: 19

Intern
Joined: 27 Feb 2011
Posts: 45

Kudos [?]: 4 [0], given: 9

### Show Tags

28 Jul 2011, 13:11
katealpha wrote:
Since he pushes the buttons SIMULTANEOUSLY #4 green, red combination is exactly the same as #4 red green

Yes, it shud be the same.. when I solved the problem I too picked 6C2 subconsciously and came up with 405 .. but yes, to your point.. when you use a combination the order doesnt matter..

Kudos [?]: 4 [0], given: 9

Joined: 31 Dec 1969

Kudos [?]: [0], given:

Location: Russian Federation
GMAT 3: 740 Q40 V50
GMAT 4: 700 Q48 V38
GMAT 5: 710 Q45 V41
GMAT 6: 680 Q47 V36
GMAT 9: 740 Q49 V42
GMAT 11: 500 Q47 V33
GMAT 14: 760 Q49 V44
WE: Supply Chain Management (Energy and Utilities)

### Show Tags

14 Aug 2011, 14:40
6C2 * 9 * 3 = 15 * 9 * 3 = 405 seconds

Kudos [?]: [0], given:

Director
Joined: 01 Feb 2011
Posts: 726

Kudos [?]: 144 [0], given: 42

### Show Tags

14 Aug 2011, 19:36
6 colors - total possible pairs = 6c2 = 15

1-9 - total possible options = 9

every attempt takes 3 seconds.

Total possible combinations = 15*9*3 = 405 seconds.

Kudos [?]: 144 [0], given: 42

Intern
Joined: 11 Jan 2012
Posts: 13

Kudos [?]: [0], given: 1

Concentration: Entrepreneurship, Economics
Schools: Thunderbird '15

### Show Tags

18 Jan 2012, 12:13
Once you find 405 seconds, shouldn't you subtract 3 seconds from that answer because the 1st try doesn't require a three second wait while the other ones do. Essentially, only 134 tries require a 3 second wait, and thus shouldn't the answer be 402 seconds (134x3)?

Please let me know where I may be understanding the question differently.

Kudos [?]: [0], given: 1

GMAT Tutor
Joined: 24 Jun 2008
Posts: 1339

Kudos [?]: 1954 [1], given: 6

### Show Tags

19 Jan 2012, 01:05
1
KUDOS
Expert's post
workingonit121 wrote:
Once you find 405 seconds, shouldn't you subtract 3 seconds from that answer because the 1st try doesn't require a three second wait while the other ones do. Essentially, only 134 tries require a 3 second wait, and thus shouldn't the answer be 402 seconds (134x3)?

Please let me know where I may be understanding the question differently.

I don't know where the question is from, and I wouldn't be at all surprised if 405 was the answer the question designer considers to be correct, but I agree with you. 405 is the number of possible codes, but 402 seconds is, by my interpretation of the question, the length of time required to test them, which is what the question asks for. That said, the wording isn't all that clear - can the spy test the first code immediately, or does it take 3 seconds to try the first code? Hard to say, and not really worth worrying about anyway since any real GMAT question will be precise about these types of points.
_________________

GMAT Tutor in Toronto

If you are looking for online GMAT math tutoring, or if you are interested in buying my advanced Quant books and problem sets, please contact me at ianstewartgmat at gmail.com

Kudos [?]: 1954 [1], given: 6

Re: Permutation and Combination   [#permalink] 19 Jan 2012, 01:05
Display posts from previous: Sort by