Challenge Problem Showdown – June 4th, 2012

Tom Williams —  June 4, 2012

We invite you to test your GMAT knowledge for a chance to win! Each week, we will post a new Challenge Problem for you to attempt. If you submit the correct answer, you will be entered into that week’s drawing for a free Manhattan GMAT Prep item. Tell your friends to get out their scrap paper and start solving!

Here is this week’s problem:

For any numbers a and b, min(a, b) and max(a, b) represent the minimum and the maximum of a and b, respectively. If c > a, is a < b < c?

(1) min(max(a, b), c) = max(min(b, c), a)

(2) max(max(a, b), c) “ min(min(bc), a) > c “ a

To see the answer choices, and to submit your answer, visit our Challenge Problem Showdown page on our site.

Discuss this week’s problem with like-minded GMAT takers on our Facebook page.

The weekly winner, drawn from among all the correct submissions, will receive One Year of Access to our Challenge Problem Archive, AND the GMAT Navigator, AND Our Six Computer Adaptive Tests ($92 value).

Tom Williams

Posts

No Comments

Be the first to start the conversation.

Leave a Reply

*

Text formatting is available via select HTML. <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>