by RonPurewal Mon May 21, 2012 6:07 am
ok, guys, we are going to kill further discussion on this thread unless and until someone can prove that the problem is actually from the OFFICIAL GMAT PREP SOFTWARE (= the only source allowed in this folder).
if anyone has a screenshot of this problem, please post it -- either directly here or by posting at an image hosting site such as postimage.org.
thanks.
--
in the meantime, note that one can solve this problem rather easily by just listing all the possibilities for the three rides. if the cars are #1, #2, and #3, then here are all of those possibilities:
1, 1, 1
1, 1, 2
1, 1, 3
1, 2, 1
1, 2, 2
1, 2, 3 *
1, 3, 1
1, 3, 2 *
1, 3, 3
2, 1, 1
2, 1, 2
2, 1, 3 *
2, 2, 1
2, 2, 2
2, 2, 3
2, 3, 1 *
2, 3, 2
2, 3, 3
3, 1, 1
3, 1, 2 *
3, 1, 3
3, 2, 1 *
3, 2, 2
3, 2, 3
3, 3, 1
3, 3, 2
3, 3, 3
there are only twenty-seven possibilities in this list, so just about everyone here should be able to make the whole list in substantially less than the allotted time.
of the possibilities in the list, exactly six (marked by asterisks) satisfy the desired condition (= each of cars #1, #2, #3 appears exactly one time), so the requisite probability is 6/27, which reduces to 2/9.