This is a GMATPrep problem
Is the integer n odd?
(1) n is divisible by 3
(2) 2n is divisible by twice as many positive integers as n
For some reason the spoiler feature is not working for me. So, OA is the answer choice # 3+5-1+2-7
Is N Odd
This topic has expert replies
- yankee.musk
- Junior | Next Rank: 30 Posts
- Posts: 15
- Joined: Fri Feb 23, 2007 1:35 pm
- GMAT Score:610
-
- Senior | Next Rank: 100 Posts
- Posts: 43
- Joined: Tue Oct 13, 2009 3:31 pm
(1) is not enough since it could be either 3, 6, 9...yankee.musk wrote:This is a GMATPrep problem
Is the integer n odd?
(1) n is divisible by 3
(2) 2n is divisible by twice as many positive integers as n
For some reason the spoiler feature is not working for me. So, OA is the answer choice # 3+5-1+2-7
(2) gonna do some tests
3*2=6.
6 is divisible by 1,2,3,6,
3 is divisible by 1,3
63*2=126
63 is divisible by 1, 3, 7, 9, 21, 63
1,2,3,7,9,21,63,126
so it doesn't tell us whether or not it's odd. this should also be impossible to tell with positive numbers. We can tell though, that it will only double the number of multiples. The total number of multiple will be 4 probably, because by multiplying a number by 2, you're adding 2 extra multiples (2, if 2 wasn't already a multiple) and the number that equals 2n.
so let's take a look at the multiples of 3.
3, 6, 9, 12.
lets look at their multiples.
1,3
1,2,3,6
1,3,9
1,2,3,4,6,12
together, with (1) and (2), the multiples of 2n are
1,2,3,6
1,2,3,4,6,12
1,2,3,6,9,18
1,2,3,4,6,8,12,24
as you can see, the answer could be either 9 or 3, so we can tell that together, we can't solve the problem, so E would be the answer.
- selango
- Legendary Member
- Posts: 1460
- Joined: Tue Dec 29, 2009 1:28 am
- Thanked: 135 times
- Followed by:7 members
From stmt1,n can be 3,6,9,12.
So A insufficient.
From stmt2,2n is divisible by twice as many positive integers as n.
We need to check this with n as odd and n as even.
1)n is odd.
n=21
n is divisible by 1,3,7,21
2n=42 = 2*(21)=2*(3*7)
42 is divisible by 1,2,3,6,7,14,21,42.
2n is divisible by twice as many positive integers as n when n is odd.
2) n is even
n=30
n=2*3*5
30 is divisible by 1,2,3,5,6,10,15,30
2n=2*(30)=2*(2*3*5)
60 is divisible by 1,2,3,4,5,6,10,12,15,30,60.
When n is even 2n ,2n is not divisible by twice as many positive integers as n.
So n is odd.
B is sufficient.
Answer is B
So A insufficient.
From stmt2,2n is divisible by twice as many positive integers as n.
We need to check this with n as odd and n as even.
1)n is odd.
n=21
n is divisible by 1,3,7,21
2n=42 = 2*(21)=2*(3*7)
42 is divisible by 1,2,3,6,7,14,21,42.
2n is divisible by twice as many positive integers as n when n is odd.
2) n is even
n=30
n=2*3*5
30 is divisible by 1,2,3,5,6,10,15,30
2n=2*(30)=2*(2*3*5)
60 is divisible by 1,2,3,4,5,6,10,12,15,30,60.
When n is even 2n ,2n is not divisible by twice as many positive integers as n.
So n is odd.
B is sufficient.
Answer is B
- yankee.musk
- Junior | Next Rank: 30 Posts
- Posts: 15
- Joined: Fri Feb 23, 2007 1:35 pm
- GMAT Score:610
Thank you all for the explanations
By the way, how do guys use spoiler feature in BTG. I'm having trouble with it.
By the way, how do guys use spoiler feature in BTG. I'm having trouble with it.
Hey, how'd you happen to pick on 63 as the no.? I tried till 21 & stmt 2 seemed to be working till thereTalkativetree wrote: 3*2=6.
6 is divisible by 1,2,3,6,
3 is divisible by 1,3
63*2=126
63 is divisible by 1, 3, 7, 9, 21, 63
1,2,3,7,9,21,63,126
I'm wondering if we can do it like this?
A & B are out of picture based on what Talkative tree said
Considering both the statements means:
n=3k
2n=6k
for k=2:
n=6 which has factors 1,2,3,6 i.e. 4 factors
2n=12 which has factors 1,2,3,4,6 i.e. 6 factors which contradicts stmnt 2 - hence the 2 statements taken together is void.
therefore, answer is E
A & B are out of picture based on what Talkative tree said
Considering both the statements means:
n=3k
2n=6k
for k=2:
n=6 which has factors 1,2,3,6 i.e. 4 factors
2n=12 which has factors 1,2,3,4,6 i.e. 6 factors which contradicts stmnt 2 - hence the 2 statements taken together is void.
therefore, answer is E
- selango
- Legendary Member
- Posts: 1460
- Joined: Tue Dec 29, 2009 1:28 am
- Thanked: 135 times
- Followed by:7 members
Jube,
U tried the stmt 2 with n as even.
with n as even,it contradicts stmt2.
Let consider n as odd.
n=9
9 is divisible by 1,3,9
2n=18=2*3*6
18 is divisible by 1,2,3,6,9,18
From this you can see that 2n is divisible by twice as many integers as n.
We dont need n to be a multiple of 3.
Take any odd and even number and you can check with stmt2
When n is odd only stmt2 can be true.
Hence B is sufficient.
U tried the stmt 2 with n as even.
with n as even,it contradicts stmt2.
Let consider n as odd.
n=9
9 is divisible by 1,3,9
2n=18=2*3*6
18 is divisible by 1,2,3,6,9,18
From this you can see that 2n is divisible by twice as many integers as n.
We dont need n to be a multiple of 3.
Take any odd and even number and you can check with stmt2
When n is odd only stmt2 can be true.
Hence B is sufficient.
I see what you're saying. You look to be right! Thanks for pointing this out. Was just wondering if there's another way of solving this one other than plugging values because with values you don't know for sure that there's some value out there that you couldn't think of which would contradict this statement.selango wrote:Jube,
U tried the stmt 2 with n as even.
with n as even,it contradicts stmt2.
Let consider n as odd.
n=9
9 is divisible by 1,3,9
2n=18=2*3*6
18 is divisible by 1,2,3,6,9,18
From this you can see that 2n is divisible by twice as many integers as n.
We dont need n to be a multiple of 3.
Take any odd and even number and you can check with stmt2
When n is odd only stmt2 can be true.
Hence B is sufficient.
-
- Legendary Member
- Posts: 576
- Joined: Sat Mar 13, 2010 8:31 pm
- Thanked: 97 times
- Followed by:1 members
From 1 clearly n can be either even or odd.
From 2,
2n has twice as many positive factor as n ,so 2n must have one more prime factor than n
as for any number N=p^a*q^b the number of factors is(a+1)(b+1)
only prime factor that 2n can have other than all prime factors of n is 2..hence n is odd..sufficient
Ans option B
From 2,
2n has twice as many positive factor as n ,so 2n must have one more prime factor than n
as for any number N=p^a*q^b the number of factors is(a+1)(b+1)
only prime factor that 2n can have other than all prime factors of n is 2..hence n is odd..sufficient
Ans option B
"If you don't know where you are going, any road will get you there."
Lewis Carroll
Lewis Carroll
Two questions:liferocks wrote: 2n has twice as many positive factor as n ,so 2n must have one more prime factor than n
as for any number N=p^a*q^b the number of factors is(a+1)(b+1)
1) I got the formula for calculating the no. of factors but why must there be only 1 more prime factor? Why not more than 1?
2) How do you know so much about no. properties? Is it something you've built up over the years or do you have a resource which mortals like me can use too?
-
- Legendary Member
- Posts: 576
- Joined: Sat Mar 13, 2010 8:31 pm
- Thanked: 97 times
- Followed by:1 members
for the question 1, let n=p^a*q^b so number of factors of n=(a+1)(b+1) and number of factors for 2n=2*(a+1)(b+1)jube wrote:Two questions:liferocks wrote: 2n has twice as many positive factor as n ,so 2n must have one more prime factor than n
as for any number N=p^a*q^b the number of factors is(a+1)(b+1)
1) I got the formula for calculating the no. of factors but why must there be only 1 more prime factor? Why not more than 1?
2) How do you know so much about no. properties? Is it something you've built up over the years or do you have a resource which mortals like me can use too?
or 2n=(1+1)*(a+1)(b+1) so 2n has one more prime factor than n has
For question 2,I am not using any specific resource..just brushed up the basics..and different forum discussions really helps!
"If you don't know where you are going, any road will get you there."
Lewis Carroll
Lewis Carroll
thanks! makes sense.liferocks wrote:
for the question 1, let n=p^a*q^b so number of factors of n=(a+1)(b+1) and number of factors for 2n=2*(a+1)(b+1)
or 2n=(1+1)*(a+1)(b+1) so 2n has one more prime factor than n has
For question 2,I am not using any specific resource..just brushed up the basics..and different forum discussions really helps!
what other forums do you use?
-
- Legendary Member
- Posts: 576
- Joined: Sat Mar 13, 2010 8:31 pm
- Thanked: 97 times
- Followed by:1 members
As of now only btg..I should rephrase my sentence 'different forum discussions really helps' as 'different discussions in the forum really helps'jube wrote:thanks! makes sense.liferocks wrote:
for the question 1, let n=p^a*q^b so number of factors of n=(a+1)(b+1) and number of factors for 2n=2*(a+1)(b+1)
or 2n=(1+1)*(a+1)(b+1) so 2n has one more prime factor than n has
For question 2,I am not using any specific resource..just brushed up the basics..and different forum discussions really helps!
what other forums do you use?
"If you don't know where you are going, any road will get you there."
Lewis Carroll
Lewis Carroll
-
- GMAT Instructor
- Posts: 1578
- Joined: Thu May 28, 2009 8:02 am
- Thanked: 128 times
- Followed by:34 members
- GMAT Score:760
Is there a number properties rule that will help me think about this problem or is there an algebraic way to solve this. I mean, I really hate having to just pick numbers, but is that the only way to do this?
https://www.beatthegmat.com/the-retake-o ... 51414.html
Brandon Dorsey
GMAT Instructor
Veritas Prep
Buy any Veritas Prep book(s) and receive access to 5 Practice Cats for free! Learn More.
Brandon Dorsey
GMAT Instructor
Veritas Prep
Buy any Veritas Prep book(s) and receive access to 5 Practice Cats for free! Learn More.