Tricky Number Property DS

This topic has expert replies
Source: — Data Sufficiency |

User avatar
Community Manager
Posts: 1537
Joined: Mon Aug 10, 2009 6:10 pm
Thanked: 653 times
Followed by:252 members

by papgust » Tue Dec 15, 2009 4:20 am
Looks like stmt 2 doesn't make sense. Possible values of n to satisfy "n divisible by 2^(n-1)" are 1, 2. When you combine, the result is not meaningful (The 2nd statement seems to contradict 1st stmt which i believe is definitely not possible in GMAT).

Please correct me if i'm wrong anywhere.

Master | Next Rank: 500 Posts
Posts: 146
Joined: Wed Aug 27, 2008 5:41 am
Thanked: 3 times

by apoorva.srivastva » Tue Dec 15, 2009 4:33 am
hey pap...sorry i mistyped the the second statement!!!

it is n>1

GMAT Instructor
Posts: 1302
Joined: Mon Oct 19, 2009 2:13 pm
Location: Toronto
Thanked: 539 times
Followed by:164 members
GMAT Score:800

by Testluv » Tue Dec 15, 2009 1:05 pm
Papgust is right about statement 1:

2^n-1. When you see a minus sign in the exponent, recall the exponent rule where you subtract exponents. We subtract exponents when we divide. So, 2^n-1 = 2^n/2^1. If n is divisible by this, we have: n/(2^n/2^1), and when we are dividing by a fraction we multiply the numerator by the reciprocal of the fraction in the denominator:
2n/2^n. If n is a non-negative integer, that equation only works if n is 0, 1 or 2.
Last edited by Testluv on Tue Dec 15, 2009 7:00 pm, edited 1 time in total.
Kaplan Teacher in Toronto

Junior | Next Rank: 30 Posts
Posts: 24
Joined: Wed Oct 21, 2009 3:19 pm

by sangeethmani » Tue Dec 15, 2009 6:21 pm
What if n =-2. then 2^n-1 would be 2^-2-1= 2^-3
there fore
===>-3/ 2^-3
==>-3*8=-24 is an integer rite?

Junior | Next Rank: 30 Posts
Posts: 24
Joined: Wed Oct 21, 2009 3:19 pm

by sangeethmani » Tue Dec 15, 2009 6:22 pm
Pls help:)

GMAT Instructor
Posts: 1302
Joined: Mon Oct 19, 2009 2:13 pm
Location: Toronto
Thanked: 539 times
Followed by:164 members
GMAT Score:800

by Testluv » Tue Dec 15, 2009 6:41 pm
sangeethmani wrote:What if n =-2. then 2^n-1 would be 2^-2-1= 2^-3
there fore
===>-3/ 2^-3
==>-3*8=-24 is an integer rite?
Yes, (1) permits n being absolutely ANY negative integer; you will always end up multiplying an integer by an integer, which is always an integer; this is why I basically ignored this as obvious--should have been clearer. But in your post n =-2 (not -3) so the result would be -16 (not -24).

At any rate, (1) is clearly insufficient whether you consider negative or not. This problem hinges on recognizing that there are only 2 positive values that n can take: 1 or 2.
Kaplan Teacher in Toronto

Junior | Next Rank: 30 Posts
Posts: 24
Joined: Wed Oct 21, 2009 3:19 pm

by sangeethmani » Tue Dec 15, 2009 7:13 pm
I guess I got it wrong.. I was thought the question stem asked us to prove that it is an integer.. Looks like it is asking it's value.. In that cas it is just 2 which can give the answer:)

GMAT Instructor
Posts: 1302
Joined: Mon Oct 19, 2009 2:13 pm
Location: Toronto
Thanked: 539 times
Followed by:164 members
GMAT Score:800

by Testluv » Tue Dec 15, 2009 8:32 pm
Well, actually "just 2" isn't right either. And the question is indeed asking for the value of n.

_________________

It is important to have a good technique for DS in order to avoid common pitfalls, and to be efficient. Here is the Kaplan method in a nutshell:

All DS questions are either "value" or "yes/no" question. The first thing you should do in a DS question is determine what kind it is. The next thing you should do is take stock of all the information given (and not given) in the question stem. Finally, and perhaps most importantly, you should think about what kind of information you would need in order to answer the question.

Only after doing all that should you approach the statements.

Evaluate the first statement first unless the second statement is clearly easier. Analyze the statements seperately from each other; for example, if you looked at the first statement first, when looking at the second one you should "forget" the first. Evaluate the statements in combination only if necessary.

Applied here:

The question stem's wording was most likely: "If n is an integer, what is the value of n?"

From this question stem, we know that n is an integer; we don't know anything else. We are asked for the value of n. What kind of info would we need in order to answer this question? In a value question, a statement has to lead to just one and only one value in order to be sufficient. Anything else (no value, multiple values, undefined values is insufficient). So, any information that allows us to detrermine one and only one value for n would be sufficient. On to the statements.

(1):

n being divisible by 2^n-1 means that n is a multiple of 2^n-1: n/(2^n-1) We can rearrange this expression to 2n/2^n. But in order to satisfy this expression n can be multiple values. Insufficient.

From (2), we have absolutely no idea what the value of n is. Insufficient.

Because the statements are insufficient by themselves, it is necessary to combine them.

(1) + (2):

From (2), we know that n must be greater than (but cannot be) 1. Now, looking at (1) more closely we can determine that the only positive values n can take in (1) are 1 and 2. But because (2) tells us us that n cannot be 1, n must equal 2, and the statements are sufficient when combined. Choose C.

____________________

Develping your procedure for DS is at least as (and maybe more) important than knowing content. It is important to develop a procedure that is efficient. Here, because a Kaplan-trained student would have identified this as a value question, the moment she saw that (1) allowed for multiple values, she knows (1) is insufficent; it doesn't matter how she saw this. That is, as soon as you saw n could be 1 or 2, it is insufficient. Alternatively, because 0 is an integer and 0 divided by any non-zero number is 0 if you saw that n could be 0 or 1, you know it is insufficient. Or, if you saw that n could be any negative integer, it is insufficient. That is, as a matter of test-taking procedure, you didn't have to determine ALL of those things to see that (1) is insufficient; you just needed to determine ANY of those things.

The Kaplan method for Data Sufficiency:
Step 1: Focus on the question stem.
Step 2: Evaluate each statement in conjunction with the question stem but separately from each other.
Step 3: Combine the statements only if necessary.

Sangeet, because reading the question stem threw you here, here's a tip for teling apart yes/no from value: if the question clause starts with "is", "does", or "are" it is a yes/no question. Here, the question clause is "what is the value of n?"
Kaplan Teacher in Toronto