GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 21 Oct 2019, 13:28

### GMAT Club Daily Prep

#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

#### Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Author Message
Intern
Joined: 27 Feb 2019
Posts: 1

### Show Tags

11 Apr 2019, 01:26
Hey guys!

I have question regarding an overall DS Strategy.

So I have read multiple timesaver know, that the two given statements in a DS question cannot contradict each other.

Let’s say a DS Question asks us whether x > 0?

If statement (1) establishes that this is allways true (Sufficient), Statement (2) cannot establish that this statement is allways wrong. So statement (2) could only also prove that the question is allways correct, or be insufficient.

Meaning a DS question like this would never exist:

Is x > 0 ?

(1) x+1 > 1
(2) x - 1 < -1

Because the two statements contradict each other.

My Question now is the following.

If I can somehow say a statement (1) is allways TRUE, isn’t one scenario for statement (2) in which the question is FALSE sufficient to prove that the solution is A?

The logic behind it being that statement (2) will not prove that the question is allways FALSE, as this would then contradict statement (1).

Because we have established that Statement (1) is correct (B, C and E are out) and that statement (2) alone cannot be sufficient without contradicting statement (1) (D is out as well) the answer has to be A.

This seems a little to good to be true as it would greatly reduce the workload for the statement (2) in many cases.

Am I missing something?
I hope I could express what I mean.
Should this topic already be discussed some place else, sorry for the repost and thank you for posting the Link to that post

Thanks guys!

Posted from my mobile device
Target Test Prep Representative
Status: Founder & CEO
Affiliations: Target Test Prep
Joined: 14 Oct 2015
Posts: 8117
Location: United States (CA)

### Show Tags

11 Apr 2019, 07:05
1
Hi GMATDamon,

You actually bring up a really cool point, and I agree with what you are saying.

Take this example here: https://gmatclub.com/forum/is-x-y-1-x-y ... 35241.html

We are being asked "Is |x| = |y| ?"

Looking at statement (2), we can see that x = -y, and thus, using statement (2), we can say that YES |x| WILL ALWAYS EQUAL |y|, right?

Now looking at statement (1), which reads x - y = 6.

You may be tempted to say that whatever values you use for x and y, the answer will always be NO. However, since we are 100% certain that statement (2) is sufficient, there must be values of x and y such that statement (1) produces a NO answer and a YES answer.

(If you were wondering what those values are, when x = 3 and y = -3, we have answer of YES, and when x = 6 and y = 0, among others, we have an answer of NO.)

So, we can tell that statement (1) must be insufficient just by determining that there are values of x and y such the statement (1) produces a NO answer.

So although this method of solving a DS question works for only a small percentage of DS questions, it’s pretty cool to take the above approach, when applicable.
_________________

# Scott Woodbury-Stewart

Founder and CEO

Scott@TargetTestPrep.com
122 Reviews

5-star rated online GMAT quant
self study course

See why Target Test Prep is the top rated GMAT quant course on GMAT Club. Read Our Reviews

If you find one of my posts helpful, please take a moment to click on the "Kudos" button.

VP
Joined: 30 Jan 2016
Posts: 1160

### Show Tags

Updated on: 11 Apr 2019, 13:41
1
Hi GmatDamon,

Welcome to gmatclub!

Is x > 0 ?
(1) x+1 > 1

x>0
Sufficient: YES, x>0. This is sufficient to answer the question

(2) x - 1 < -1
x<0
Sufficient: NO, x is NOT >0. This is sufficient to answer the question

D

However, you will not see such a question on gmat as statements (1) and (2) contradict to each other. Read here:

https://gmatclub.com/forum/data-suffici ... 30500.html
http://www.gmathacks.com/data-sufficien ... other.html
_________________
Non progredi est regredi

Originally posted by Akela on 11 Apr 2019, 08:27.
Last edited by Akela on 11 Apr 2019, 13:41, edited 1 time in total.
VP
Joined: 23 Feb 2015
Posts: 1263

### Show Tags

11 Apr 2019, 09:17
GmatDamon wrote:
Hey guys!

Am I missing something?
I hope I could express what I mean.
Should this topic already be discussed some place else, sorry for the repost and thank you for posting the Link to that post

Thanks guys!

Posted from my mobile device

_________________
“The heights by great men reached and kept were not attained in sudden flight but, they while their companions slept, they were toiling upwards in the night.”

Do you need official questions for Quant?
3700 Unique Official GMAT Quant Questions
------
SEARCH FOR ALL TAGS
GMAT Club Tests
Director
Joined: 12 Feb 2015
Posts: 917

### Show Tags

11 Apr 2019, 09:44
GmatDamon wrote:
Hey guys!

I have question regarding an overall DS Strategy.

So I have read multiple timesaver know, that the two given statements in a DS question cannot contradict each other.

Let’s say a DS Question asks us whether x > 0?

If statement (1) establishes that this is allways true (Sufficient), Statement (2) cannot establish that this statement is allways wrong. So statement (2) could only also prove that the question is allways correct, or be insufficient.

Meaning a DS question like this would never exist:

Is x > 0 ?

(1) x+1 > 1
(2) x - 1 < -1

Because the two statements contradict each other.

My Question now is the following.

If I can somehow say a statement (1) is allways TRUE, isn’t one scenario for statement (2) in which the question is FALSE sufficient to prove that the solution is A?

The logic behind it being that statement (2) will not prove that the question is allways FALSE, as this would then contradict statement (1).

Because we have established that Statement (1) is correct (B, C and E are out) and that statement (2) alone cannot be sufficient without contradicting statement (1) (D is out as well) the answer has to be A.

This seems a little to good to be true as it would greatly reduce the workload for the statement (2) in many cases.

Am I missing something?
I hope I could express what I mean.
Should this topic already be discussed some place else, sorry for the repost and thank you for posting the Link to that post

Thanks guys!

Posted from my mobile device

Can you share an official question, which you have come across and then relate your point to that question?
_________________
________________
Manish

"Only I can change my life. No one can do it for me"
Display posts from previous: Sort by

Moderator: DisciplinedPrep