Challenge Problem Showdown – June 11th, 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:

Z is the set of the first n positive odd numbers, where n is a positive integer. Given that nk, where k is also a positive integer, x is the maximum value of the sum of k distinct members of Z, and is the minimum value of the sum of k distinct members of Z, what isx + y?

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).

No comments yet