If n is an integer, then n is divisible by how many positive : GMAT Data Sufficiency (DS)
Check GMAT Club Decision Tracker for the Latest School Decision Releases https://gmatclub.com/AppTrack

 It is currently 22 Feb 2017, 15:12

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

Author Message
TAGS:

### Hide Tags

Intern
Joined: 11 Jun 2008
Posts: 2
Followers: 0

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

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

### Show Tags

11 Jun 2008, 22:47
00:00

Difficulty:

25% (medium)

Question Stats:

70% (01:56) correct 30% (00:51) wrong based on 74 sessions

### HideShow timer Statistics

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

(1) n is the product of two different prime numbers.
(2) n and 2^3 are each divisible by the same number of positive integers.

OPEN DISCUSSION OF THIS QUESTION IS HERE: if-n-is-an-integer-then-n-is-divisible-by-how-many-positive-164964.html

[Reveal] Spoiler:
OA: D

ii) i understand

but if i)

let prime numbers be 3,4, then there are 4 possible divisors (1,3,4,12)
but if the prime numbers are 1,2, then there are only 2 possible divisors (1,2)

anyone?

nm just realized that 1 is not a prime number.
[Reveal] Spoiler: OA

Last edited by Bunuel on 08 Feb 2014, 01:05, edited 1 time in total.
Renamed the topic, edited the question and added the OA.
CEO
Joined: 17 Nov 2007
Posts: 3589
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 556

Kudos [?]: 3664 [0], given: 360

### Show Tags

11 Jun 2008, 23:02
zetaexmachina wrote:
let prime numbers be 3,4, then there are 4 possible divisors (1,3,4,12)
but if the prime numbers are 1,2, then there are only 2 possible divisors (1,2)

anyone?

nm just realized that 1 is not a prime number.

4 and 1 are not prime numbers.

3,5 - (1,3,5,15)
5,7 - (1,5,7,35)
_________________

HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android) - The OFFICIAL GMAT CLUB PREP APP, a must-have app especially if you aim at 700+ | PrepGame

Intern
Joined: 01 Aug 2006
Posts: 35
Followers: 0

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

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

### Show Tags

07 Feb 2014, 17:37
If n is an integer, n is divisible by how many positive integers? -> # factors of n????

i) n is the product of two prime numbers -> n = p^1 * q^1, where p and q are prime; number of factors of n = 4.
ii) n and 2^3 are each divisible by the same number of positive integers -> 2^3 has 4 factors => n has 4 factors.

D
Math Expert
Joined: 02 Sep 2009
Posts: 37083
Followers: 7243

Kudos [?]: 96333 [0], given: 10737

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

### Show Tags

08 Feb 2014, 01:05
Expert's post
1
This post was
BOOKMARKED
Finding the Number of Factors of an Integer

First make prime factorization of an integer $$n=a^p*b^q*c^r$$, where $$a$$, $$b$$, and $$c$$ are prime factors of $$n$$ and $$p$$, $$q$$, and $$r$$ are their powers.

The number of factors of $$n$$ will be expressed by the formula $$(p+1)(q+1)(r+1)$$. NOTE: this will include 1 and n itself.

Example: Finding the number of all factors of 450: $$450=2^1*3^2*5^2$$

Total number of factors of 450 including 1 and 450 itself is $$(1+1)*(2+1)*(2+1)=2*3*3=18$$ factors.
For more on number properties check: math-number-theory-88376.html

BACK TO THE ORIGINAL QUESTION:

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

(1) n is the product of two different prime numbers --> n=ab, where a and b are primes, so # of factors is (1+1)(1+1)=4. Sufficient.

(2) n and 2^3 are each divisible by the same number of positive integers --> 2^3 has 4 different positive factors (1, 2, 4, and 8) so n has also 4. Sufficient.

OPEN DISCUSSION OF THIS QUESTION IS HERE: if-n-is-an-integer-then-n-is-divisible-by-how-many-positive-164964.html
_________________
Re: If n is an integer, then n is divisible by how many positive   [#permalink] 08 Feb 2014, 01:05
Similar topics Replies Last post
Similar
Topics:
11 If n is an integer, then n is divisible by how many positive integers? 10 01 Oct 2014, 18:05
22 If n is an integer, then n is divisible by how many positive 12 24 Dec 2013, 02:48
46 The integers n and t are positive and n > t > 1. How many 8 31 Mar 2012, 06:34
5 If n is an integer, then n divisible by how many positive 8 19 Feb 2011, 09:29
7 If N is a positive integer, not including N, how many 11 27 Oct 2008, 01:19
Display posts from previous: Sort by