GMAT Challenge Problem Showdown: October 14, 2013

Lauren Golin —  October 14, 2013 — 1 Comment

challenge problem
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:

If acdx, and y are positive integers such that ay < x and  is the lowest-terms representation of the fraction , then c is how much greater than d? (If  is an integer, let d = 1.)

(1)  is an odd integer.

(2) a = 4

GMAT Challenge ProblemTo 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).

Lauren Golin

Posts

One response to GMAT Challenge Problem Showdown: October 14, 2013

  1. if the question is what is k, for c=k+d or c=kd

    Simplify it to, (X/Y + A) / (X/Y – A)

    there seems to be so many solutions if you pick numbers for A. so many solutions for B. and if you combine both, there are so many solutions.

Leave a Reply