Hi ragor60,
While there is a little ambiguity in the James Bond question, it is relatively a simple one. The spy completes two things or an attempt in 3 seconds: key-in a numeral (1-9) and press a pair of two differently colored buttons.
Since there is an AND in the events, we would multiply the number of ways:
1. Total possible number of ways to key-in a number = 9;
2. Total number of ways to press a pair of two
differently colored buttons = 6C2 = (6*5)/(1*2) = 15. Note that we need not apply permutation here (6P2) as the order of the colors of two buttons is not important (Not stated). Since he is James Bond, it smacks of order too! Anyways, had this been the case, the answer would have been more than the last option E (6.75 min.), which is not possible.
Total longest possible time means that the spy is able to unlock at the very last attempt. Thus the longest possible time = (9*15*3)/60 = 6.75''.
It takes 3 seconds to execute every successful and unsuccessful attempt.
-Jay
_________________
Manhattan Rewiew GMAT Prep
Locations:
New York |
Frankfurt |
Hong Kong |
Zurich | and many more...
Schedule your free consultation with an experienced GMAT Prep Advisor!
Click here.