BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

DS

Expert replies
by allfta » Sat Jun 12, 2010 9:10 pm
Thank you for all!

If # represents one of the operations +,-,and x, is k # (l+m) = (k # l) + (k # m) for all numbers k, l, and m?
1) k # 1 is not equal to 1 # k for some numbers k.
2) # represents subtraction.
Answer]D

In this question, both #s of 1) and 2) are minus. right?
So, the answer of the initial question is "NO". right?
I wonder that I can choose D because I can say "No" but not because I cann't say whether the answer is yes or no.
Consequently, is it still ok when the answer is "no" but rather "yes" to answer the DS quetion?

So, If
1) # represents +
2) # represents +
then the answer is still D

and, if

1)# represents x
2)# repreestns +
then the answer is E?
Join the discussion
Source: — Data Sufficiency |

by Rahul@gurome » Sun Jun 13, 2010 1:41 am
The answer to this question is definitely "no". It is not necessary that the question should have the answer "yes", the thing is we should have a definite answer. (I hope that is what you want to ask?)

If the operator is "+", then k + (l+m) = (k + l) + (k + m) = 2k + (l + m), which implies k = 2k, but k is not equal to 2k for all values of k. So, # cannot represent "+". So, the answer is "no" here.

If the operator is "-", then k - (l+m) = (k - l) + (k - m) = 2k - (l + m), which implies k = 2k, but k is not equal to 2k for all values of k. So, # cannot represent "-". Again the answer is "no".

Lastly, if the operator is "*", then k * (l+m) = (k * l) + (k * m) = kl + km, which implies kl + km = kl + km, which definitely is true for all values of k. So, the answer here is "yes".
So, the question can be rephrased as "Does # represent the operator multiplication?" And then we go to each of the statements.

(1) k # 1 is not equal to 1 # k for some numbers k.
If # = "+", then k + 1 = 1 + k is always true. So the operator is not "+".
If # = "-", then k - 1 = 1 - k is only true when k = 1. So the operator may be "-".
If # = "*", then k * 1 = 1 * k is always true. So the operator is not "*".
Hence, # is the operator "-" from statement 1, and the answer to the main question is definitely "no". So, (1) is SUFFICIENT to answer the question.

(2) Since # is clearly "-" here so, again the answer to the main question is definitely "no". So, (2) is SUFFICIENT to answer the question.

The correct answer is (D).
Rahul Lakhani
Quant Expert
Gurome, Inc.
https://www.GuroMe.com
On MBA sabbatical (at ISB) for 2011-12 - will stay active as time permits
1-800-566-4043 (USA)
+91-99201 32411 (India)
Join the discussion

by allfta » Mon Jun 14, 2010 5:30 am
Thank you Rahul@gurome,

You point my point. lol. I wondered whether the answer is still "sufficient" even if it says "NO" to a quetion but not "Yes"
Your explanation is yes it is still sufficient. So, we can choose D. It is clear.

But, as I asked in original post, what is the answer if
1) is +
2) is +

or

1) is +
2) is * ?

I thought the first case is still D because the answers of both condition are "No" and they are still sufficient to answer.
And in the later case, I think the answer is E because the answer of 1) is "NO" and the 2) are both "Yes" and we, consequently, can not say whether it is Yes or No.

So, this logic is right?
Many of OG quetions don't handle this No type sufficency quetions so I think this is worth to think about.
your confirmation plz.
Join the discussion

by Rich@VeritasPrep » Mon Jun 14, 2010 7:55 am
Hey there,

Let's address your two hypotheticals:

If the following were true...

1) is +
2) is +

...then yes, the answer would still be D. The prompt boils down to "Does # represent multiplication?" And as you've pointed out, both of these Statements would give you a definite "No", which means you have sufficient info to answer the question.

Now let's look at the second hypothetical you mentioned:

1) is +
2) is *

Believe it or not, this is actually impossible on the GMAT. Why? Because on real GMAT questions, the two statements never contradict one another. You've given a situation in which we have a contradiction, because # ends up being two different things.

Remember, on a YES/NO question like this, a statement is insufficient if you can get both a yes and a no WITHIN THE SAME STATEMENT. And you only combine statements when you've already concluded that EACH STATEMENT GIVES YOU A YES AND A NO INDIVIDUALLY.

But you will never see a question in which one statement leads to a yes-only and the other leads to a no-only, because that would be a contradiction.

Now, if you were given this...

1) is * or +
2) is * or +

...then that would be legal, because there's no contradiction...just incomplete information. The answer here would in fact be E, because each statement gives you both a yes and no, and when you combine the two statements, you get no additional information, since they are identical.

Make sense?
Rich Zwelling
GMAT Instructor, Veritas Prep
Join the discussion

by Testluv » Mon Jun 14, 2010 11:23 pm
You point my point. lol. I wondered whether the answer is still "sufficient" even if it says "NO" to a quetion but not "Yes"
Your explanation is yes it is still sufficient. So, we can choose D. It is clear.
Correct. If you get a "DEFINITE no" or a "DEFINITE yes" the statement is sufficient. It should be noted, however, that on the actual GMAT a statement that is sufficient to answer a yes/no question leads to a DEFINITE yes rather than a DEFINITE no more than 95% of the time.

But knowing that Definite no is sufficient is very helpful for rephrasing questions. For example, a question like this "Is x a non-integer?" can be safely rephrased to "Is x an integer?"
Kaplan Teacher in Toronto
Join the discussion

by allfta » Tue Jun 15, 2010 5:37 am
@ raz1024
Sure. You got a point. But, if this type - 1)+ 2)* type - of quetion is really presentd in real test, I'd rather to choose E but not D. Because even if they still give answers individually, but, the contradiction makes us the answer still don't know just as 1)+ or * 2)+ or * type do.

Because there is no imformation whether 1) and 2) are linked with "and" relationship or "or" relationship. :) Then, if this type is really presented, this presentation natually means that the relation is "or". (Because if it means "and" it doesn't totally make sense) Then, it can be solved with the same logic which 1)+ or * 2)+ or * type has.

Anyway, I fully agree that this type will not be definitly given. haha.
Join the discussion