Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 25 Sep 2016, 13:10

### 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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# If n is an integer, then n is divisible by how many positive

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
Manager
Joined: 14 Apr 2011
Posts: 199
Followers: 2

Kudos [?]: 23 [0], given: 19

If n is an integer, then n is divisible by how many positive [#permalink]

### Show Tags

02 Jul 2011, 01:10
00:00

Difficulty:

35% (medium)

Question Stats:

81% (01:21) correct 19% (00:43) wrong based on 35 sessions

### HideShow timer Statistics

If n is an integer, then n is divisible by how many positive integers?

(1) n and 3^4 are divisible by the same number of positive numbers.
(2) n is the product of 2 and an odd prime number.
[Reveal] Spoiler: OA

_________________

Looking for Kudos

SVP
Joined: 16 Nov 2010
Posts: 1673
Location: United States (IN)
Concentration: Strategy, Technology
Followers: 34

Kudos [?]: 481 [0], given: 36

Re: n divisible by how many positive integers [#permalink]

### Show Tags

02 Jul 2011, 01:55
(1) says :

3^4 has (3+1) = 4 factors

Hence n also has 4 factors

Sufficient.

(2) says :

n = 2 * K, where k is an odd prime number

So n has (1+1) * (1+1) = 2*2 = 4 factors

Sufficient

_________________

Formula of Life -> Achievement/Potential = k * Happiness (where k is a constant)

GMAT Club Premium Membership - big benefits and savings

Math Forum Moderator
Joined: 20 Dec 2010
Posts: 2021
Followers: 158

Kudos [?]: 1592 [0], given: 376

Re: n divisible by how many positive integers [#permalink]

### Show Tags

02 Jul 2011, 02:03
vinayrsm wrote:
If n is an integer, then n is divisible by how many positive integers?

(1) n and 3^4 are divisible by the same number of positive numbers.
(2) n is the product of 2 and an odd prime number.

St1 and St2 are contradicting each other. St1 says n has 5 positive factors; St2 says n has 4 positive factors. If we ignore this discrepancy, both statements are sufficient because we get a definite number of +ve factors for n.

Ans: "D"
_________________
SVP
Joined: 16 Nov 2010
Posts: 1673
Location: United States (IN)
Concentration: Strategy, Technology
Followers: 34

Kudos [?]: 481 [0], given: 36

Re: n divisible by how many positive integers [#permalink]

### Show Tags

02 Jul 2011, 02:08
Yes, you're right. I was in slight hurry and read 4 as 3
_________________

Formula of Life -> Achievement/Potential = k * Happiness (where k is a constant)

GMAT Club Premium Membership - big benefits and savings

Manager
Joined: 14 Apr 2011
Posts: 199
Followers: 2

Kudos [?]: 23 [0], given: 19

Re: n divisible by how many positive integers [#permalink]

### Show Tags

02 Jul 2011, 02:47
Hi Subhash & Fluke,

I want to get confirmation that "statements contradict" eachother - thats the reason behind posting this question. I was wondering whether I am missing something here.

Great. thanks both!
_________________

Looking for Kudos

Current Student
Joined: 26 May 2005
Posts: 565
Followers: 18

Kudos [?]: 197 [0], given: 13

Re: n divisible by how many positive integers [#permalink]

### Show Tags

02 Jul 2011, 02:59
vinayrsm wrote:
If n is an integer, then n is divisible by how many positive integers?

(1) n and 3^4 are divisible by the same number of positive numbers.
(2) n is the product of 2 and an odd prime number.

Whats the source? looks like the 2 statements contradict each other and this never happens on real GMAT.

st:1- n has 5 factors. ( unless there is a typo and it reads as 3^3)
S :2- n has 4 factors.

has to be D
Manager
Status: ==GMAT Ninja==
Joined: 08 Jan 2011
Posts: 247
Schools: ISB, IIMA ,SP Jain , XLRI
WE 1: Aditya Birla Group (sales)
WE 2: Saint Gobain Group (sales)
Followers: 5

Kudos [?]: 73 [0], given: 46

Re: n divisible by how many positive integers [#permalink]

### Show Tags

04 Jul 2011, 02:21
subhashghosh wrote:
(1) says :

3^4 has (3+1) = 4 factors

Hence n also has 4 factors

Sufficient.

(2) says :

n = 2 * K, where k is an odd prime number

So n has (1+1) * (1+1) = 2*2 = 4 factors

Sufficient

from Statement 1
$$3^4$$ has 5 factors as below
1, $$3^1$$,$$3^2$$,$$3^3$$,$$3^4$$

hence sufficient

from Statement 1
n = 2 * K, where k is an odd prime number
has 4 factors as below
1, 2, k,2*k
Sufficient

Hence D is the answer

hope this helps....
_________________

WarLocK
_____________________________________________________________________________
The War is oNNNNNNNNNNNNN for 720+
see my Test exp here http://gmatclub.com/forum/my-test-experience-111610.html
do not hesitate me giving kudos if you like my post.

Intern
Joined: 01 Aug 2016
Posts: 2
Followers: 0

Kudos [?]: 0 [0], given: 1

Re: If n is an integer, then n is divisible by how many positive [#permalink]

### Show Tags

12 Sep 2016, 19:20
I am sure statement A contains a typo. Data Sufficiency questions cannot contradict each other. 3^4 should read as 3^3 in order to match the four factors from statement 2.
Re: If n is an integer, then n is divisible by how many positive   [#permalink] 12 Sep 2016, 19:20
Display posts from previous: Sort by

# If n is an integer, then n is divisible by how many positive

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics

 Powered by phpBB © phpBB Group and phpBB SEO Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.