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 Your Progress

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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Hi, Since it is dealing with modulus, lets see what info we get from the Q..

Quote:

If a = b, and c = d, is |a| = |c|?

|a|=|c| means that irreespective of sign of b and d, the answer will be YES, if b and d have SAME NUMERIC VALUE.. lets see the choices.. (1) |b| = |d| same numeric value.. suff

(2) b = -d same numeric value.. suff D _________________

Re: If a = b, and c = d, is |a| = |c|? [#permalink]

Show Tags

23 Feb 2016, 09:11

Bunuel wrote:

If a = b, and c = d, is |a| = |c|?

(1) |b| = |d| (2) b = -d

Kudos for correct solution.

Statement 1: |b| = |d| This implies that either b = d or b = -d [Though, we will also get -b = -d and -b = d, we can ignore them as they are equivalent to b = d and b = -d] First consider, b = d replacing b = a and d = c, we get a = c. Hence, |a| = |c| Now, consider, b = -d Again, replacing b = a and d = c, we get a = -c Hence, |a| = |c| Therefore, in either case we are able to answer the question is |a| = |c| = 0? with a definitive 'yes'. Hence, statement 1 is sufficient. Options B, C and E are ruled out.

Statement 2: b = -d Again, replacing b = a and d = c, we get a = -c Hence, |a| = |c| Therefore, we are able to answer the question is |a| = |c| = 0? with a definitive 'yes'. Hence, statement 2 is also sufficient. Option A is also ruled out.

Forget conventional ways of solving math questions. In DS, Variable approach is the easiest and quickest way to find the answer without actually solving the problem. Remember equal number of variables and independent equations ensures a solution.

If a = b, and c = d, is |a| = |c|?

(1) |b| = |d| (2) b = -d

When you modify the original condition and the question, they become |a|=|c|?--> |b|=|d|?--> b=-d or d?, which makes 1)=2). Also, each of them is yes, which is sufficient. Therefore, the answer is D.

Once we modify the original condition and the question according to the variable approach method 1, we can solve approximately 30% of DS questions.
_________________

Re: If a = b, and c = d, is |a| = |c|? [#permalink]

Show Tags

10 May 2016, 13:20

From the question it is clear that we have to check if numerical values of a and c are equal (signs will not matter) Statement 1 says |b| = |d| . It clearly shows that |a| = |c| as a = b and c = d so sufficient Statement 2 says b = -d. It clearly tells that numerical value of b and d is same which in turn says |a| = |c| so sufficient Correct answer - D

mod is always positive, so if \(x<0\) i.e negative then \(|x| =-x\)

for eg. if \(x=-3\) then \(|-3|=-(-3)=3\)

how did you use above knowledge to infer below :

Quote:

\(|b|=|-d|\), apply mod on both sides

which in turn is \(|b|=|d|\),

To be more specific, \(|b|=|d|\), note that we do not know whether b or d is less than zero but all we know is that b and d have opposite signs. Let me know if I missed anything.
_________________

mod is always positive, so if \(x<0\) i.e negative then \(|x| =-x\)

for eg. if \(x=-3\) then \(|-3|=-(-3)=3\)

how did you use above knowledge to infer below :

Quote:

\(|b|=|-d|\), apply mod on both sides

which in turn is \(|b|=|d|\),

To be more specific, \(|b|=|d|\), note that we do not know whether b or d is less than zero but all we know is that b and d have opposite signs. Let me know if I missed anything.

As I mentioned mod is always positive, because it represents the distance from the 0-point in the number line and distance cannot be negative. so irrespective of the value of b or d; |-d|=|d|

let b=2 then b=-d will result in d=-2

So |2|=2 and |-2|=-(-2)=2=|2| so we have |b|=|-d| =>|b|=|d|