I think answer is B.
Rephrase the question. What is the sign of m or p? Since mv and pv are negative, either mv must be +- or -+ and pv must be +- or -+ to make a negative product and adhere to the restrictions in the stem.
1) m<p - Insufficient. doesn't help us to determine whether m or p is positive or negative
2) m<0 - Sufficient. Knowing that m is negative allows us to conclude that v is positive.
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
Target Test Prep GMAT OnDemand
Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.
- 715+ score guarantee — highest in the industry (99th percentile)
- 52 chapters · 1,500+ lessons · 4,000+ practice questions
- 400 hours of video · 1,500+ instructor-led HD smartboard lessons
- 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
- 24/7 live support + weekly Zoom office hours with GMAT instructors
- TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
- 1,200+ flashcards + AI-powered study assistant & daily calendar
- OnDemand, LiveTeach & GMAT Bootcamp formats available
- Also: GRE, SAT Math & Executive Assessment courses
- MBA Admissions Consulting now available
- 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
- 200,000+ students served
- 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★
5.0
(559 reviews)
130-pt guarantee
$0 to start
then $127/mo
Gmat prep 2 - Numbers properties
Source: Beat The GMAT — Data Sufficiency |
In order for mv and pv to be less than 0, we have one of two cases:
1) v < 0 (and m>0, p>0)
or
2) m<0 and p<0 (and v>0)
The reason is that a negative number is the product of a positive number and a negative number.
Statement 1 tells us that m<p. This is not sufficient information to find out if the two numbers are negative or positive, though. So, statement 1 is not sufficient on its own.
Statement 2 tells us that m<0. So, we know we have "case 2", ie that v>0. So, statement 2 is sufficient and the answer is B.
1) v < 0 (and m>0, p>0)
or
2) m<0 and p<0 (and v>0)
The reason is that a negative number is the product of a positive number and a negative number.
Statement 1 tells us that m<p. This is not sufficient information to find out if the two numbers are negative or positive, though. So, statement 1 is not sufficient on its own.
Statement 2 tells us that m<0. So, we know we have "case 2", ie that v>0. So, statement 2 is sufficient and the answer is B.
Tatiana Becker | GMAT Instructor | Veritas Prep
Thanks for catching my mistake-
I now see how 1) is sufficient.
consider:
for mv<pv<0, m and p must be negative when m<p
Ex:
If m and p are positive then you can have 2*-1 < 3*-1 < 0 which violates the restriction that mp<pv
If m and p are negative then you can have -2*1 < -1*1 < 0 which satisfies all restrictions.
I now see how 1) is sufficient.
consider:
for mv<pv<0, m and p must be negative when m<p
Ex:
If m and p are positive then you can have 2*-1 < 3*-1 < 0 which violates the restriction that mp<pv
If m and p are negative then you can have -2*1 < -1*1 < 0 which satisfies all restrictions.
is it a right approach, someone please let me know.
mv<pv<0
(m-p)v<0
stmt 1 says m<p hence m-p<0 v>0
stmt 2 says m<0 given mv<0 hence v>0.
ANS D.
regards,
mv<pv<0
(m-p)v<0
stmt 1 says m<p hence m-p<0 v>0
stmt 2 says m<0 given mv<0 hence v>0.
ANS D.
regards,
Cubicle Bound Misfit
cubicle_bound_misfit wrote: mv<pv<0
(m-p)v<0
stmt 1 says m<p hence m-p<0 v>0
stmt 2 says m<0 given mv<0 hence v>0.
ANS D.
regards,
Yes, excellent approach- nicely done.cubicle_bound_misfit wrote:is it a right approach, someone please let me know.

















