Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Apr 2610:00 AM EDT
-11:00 AM EDT
The Target Test Prep course represents a quantum leap forward in GMAT preparation, a radical reinterpretation of the way that students should study. Try before you buy with a 5-day, full-access trial of the course for FREE!
Apr 2711:00 AM EDT
-12:00 PM EDT
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
18 Mar 2022, 01:30
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
25%
(medium)
Question Stats:
69% (01:02) correct
31%
(00:57)
wrong
based on 303
sessions
History
Date
Time
Result
Not Attempted Yet
Is c = d ?
(1) cd = 1
(2) |c| = d
(1) cd = 1
(2) |c| = d
18 Mar 2022, 13:16
Kudos
Bookmarks
(1) cd = 1
insufficient because we can pick different numbers as c and d that multiplied gives 1 e.g:
(2/7)*(7/2)=1 and in this case c=/=d
or
1*1=1 in this case c=d
(2) |c| = d
insufficient because
e.g. if c=-5 and d=5 the equation from the statement will hold true but the numbers are not equal so the answer would be NO
if c=1 and d=1 the statement also will hold true and c=d so the answer for the question would be YES
taking 1) and 2) together: c*d=1 and |c|=d
we can distinguish various options fulfilling this requirements e.g.: c=-1 and d=-1 then c*d=1 because (-1)*(-1)=1 but then second statement won't be true because |-1|=/=-1 (absolute value always positive)
so IMO the answer is E
insufficient because we can pick different numbers as c and d that multiplied gives 1 e.g:
(2/7)*(7/2)=1 and in this case c=/=d
or
1*1=1 in this case c=d
(2) |c| = d
insufficient because
e.g. if c=-5 and d=5 the equation from the statement will hold true but the numbers are not equal so the answer would be NO
if c=1 and d=1 the statement also will hold true and c=d so the answer for the question would be YES
taking 1) and 2) together: c*d=1 and |c|=d
we can distinguish various options fulfilling this requirements e.g.: c=-1 and d=-1 then c*d=1 because (-1)*(-1)=1 but then second statement won't be true because |-1|=/=-1 (absolute value always positive)
so IMO the answer is E
19 Mar 2022, 05:37
Kudos
Bookmarks
Statement 1 is not sufficient, because maybe c = d = 1, or maybe c = 1/2 and d = 2. Statement 2 is not sufficient because maybe c = d = 1, or maybe c = -1 and d = 1, among other possibilities.
Using both Statements, if cd = 1, then cd is positive, and c and d have the same sign. But we also know d = |c|, so d equals the absolute value of something nonzero, and d must be positive. Since c and d have the same sign, c is also positive, and if c is positive, |c| = c. So Statement 2 tells us d = c, and the answer is C (or you could notice Statement 2 tells you that either d = c or d = -c, and notice only the "c = d" case works with Statement 1, since in the c = -d case, we don't get any real number solutions).
Here, I think you may have done something many people do, especially in more abstract DS questions -- I think you may have assumed, when you used both Statements, that the answer to the question "Is c = d?" is "yes", and then tried to prove whether Statement 2 was true or false. But any time you do that, you're doing DS in the wrong direction -- in DS, the Statements are facts, so they can never be false. If you invent a numerical example that makes a Statement false, then it's an example that is simply not relevant to the problem, and you'll need to look elsewhere for valid examples (or you might try to solve the problem in a different way).
What we don't know here is the answer to the original question "is c = d?", and you don't want to assume the answer to that question in advance (that's technically what is known as "begging the question" in logic, though that phrase often has the unrelated meaning "raising the question" in everyday speech). If you were hoping to prove the answer is E here by inventing numerical examples, your goal is to try to come up with one numerical example that works with both Statements, and that makes the answer to the original question "yes" (the only such example is c = d = 1 in this question), and one numerical example that works with both Statements, and that makes the answer to the original question "no" (so here you'd be looking for numbers where c is not equal to d, but which work with both Statements -- if you could do that here the answer would definitely be E, but in this particular problem, that turns out to be impossible, so the answer is C; the answer to the original question must be "yes" when we use both Statements).
Using both Statements, if cd = 1, then cd is positive, and c and d have the same sign. But we also know d = |c|, so d equals the absolute value of something nonzero, and d must be positive. Since c and d have the same sign, c is also positive, and if c is positive, |c| = c. So Statement 2 tells us d = c, and the answer is C (or you could notice Statement 2 tells you that either d = c or d = -c, and notice only the "c = d" case works with Statement 1, since in the c = -d case, we don't get any real number solutions).
nielubiematmy
Here, I think you may have done something many people do, especially in more abstract DS questions -- I think you may have assumed, when you used both Statements, that the answer to the question "Is c = d?" is "yes", and then tried to prove whether Statement 2 was true or false. But any time you do that, you're doing DS in the wrong direction -- in DS, the Statements are facts, so they can never be false. If you invent a numerical example that makes a Statement false, then it's an example that is simply not relevant to the problem, and you'll need to look elsewhere for valid examples (or you might try to solve the problem in a different way).
What we don't know here is the answer to the original question "is c = d?", and you don't want to assume the answer to that question in advance (that's technically what is known as "begging the question" in logic, though that phrase often has the unrelated meaning "raising the question" in everyday speech). If you were hoping to prove the answer is E here by inventing numerical examples, your goal is to try to come up with one numerical example that works with both Statements, and that makes the answer to the original question "yes" (the only such example is c = d = 1 in this question), and one numerical example that works with both Statements, and that makes the answer to the original question "no" (so here you'd be looking for numbers where c is not equal to d, but which work with both Statements -- if you could do that here the answer would definitely be E, but in this particular problem, that turns out to be impossible, so the answer is C; the answer to the original question must be "yes" when we use both Statements).
