Blog

# The Quest for 700: Weekly GMAT Challenge (Answer)

Yesterday, Manhattan GMAT posted a 700 level GMAT question on our blog. Today, they have followed up with the answer:

We can solve this problem either by algebra or by number-plugging. Let’s use algebra. All four variables can be expressed in terms of just one variable, since they are consecutive integers and we know their order. If we keep p as the basic variable, then q = p + 1, r = p + 2, and s = p + 3.

Now we can rephrase the question:
Is pr < qs?
Is p(p + 2) < (p + 1)(p + 3)?
Is p2 + 2p < p2 + 4p + 3?
Is 2p < 4p + 3?
Is 0 < 2p + 3?
Is -3 < 2p?
Is -3/2 < p?

Since p is an integer, the question is answered “yes” if p = -1 or greater, and “no” if p = -2 or less.

Statement (1): SUFFICIENT.
We rephrase the statement similarly.
pq < rs
p(p + 1) < (p + 2)(p + 3)
p2 + p < p2 + 5p + 6
0 < 4p + 6
0 < 2p + 3
-3/2 < p

This is precisely the same condition as asked in the question. Thus, we can answer the question definitively.

Statement (2): INSUFFICIENT.
Again, we rephrase the statement similarly.
ps < qr
p(p + 3) < (p + 1)(p + 2)
p2 + 3p < p2 + 3p + 2
0 < 2

Since 0 is always less than 2, no matter the value of p, the statement is always true. Thus, we do not gain any information that would help us answer the question.

The correct answer is A: Statement (1) is sufficient, but statement (2) is not.

### Upcoming Events

• Dartmouth Tuck (Round 3)
• London Business School (Round 3)
• Texas McCombs (Round 3)
• Vanderbilt Owen (Round 4)
• Berkeley Haas (Round 4)
• Penn State Smeal (Round 4)
• Penn Wharton (Round 3)
• Columbia (Round 3)
• Northwestern Kellogg (Round 3)
• Virginia Darden (Round 3)
• Chicago Booth (Round 3)
• Michigan Ross (Round 3)
• MIT Sloan (Round 3)
• Stanford GSB (Round 3)
• Yale SOM (Round 3)
• Cornell Johnson (Round 3)
• UCLA Anderson (Round 3)
• USC Marshall (Round 3)
• Toronto Rotman (Round 4)
• UNC Kenan-Flagler (Round 4)
• Georgetown McDonough (Round 4)