GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 19 Sep 2019, 18:34

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

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

Author Message
TAGS:

### Hide Tags

Senior Manager
Status: No dream is too large, no dreamer is too small
Joined: 14 Jul 2010
Posts: 453
If n is an integer, then n divisible by how many positive  [#permalink]

### Show Tags

19 Feb 2011, 10:29
6
00:00

Difficulty:

5% (low)

Question Stats:

78% (01:01) correct 22% (01:10) wrong based on 275 sessions

### HideShow timer Statistics

If n is an integer, then n 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.

_________________
Math Expert
Joined: 02 Sep 2009
Posts: 58117

### Show Tags

19 Feb 2011, 10:40
1
3
Baten80 wrote:
If n is an integer, then n 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.

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

_________________
Director
Joined: 29 Nov 2012
Posts: 722
if n is an integer, then n is divisible by how many positive  [#permalink]

### Show Tags

29 Jan 2013, 22:52
if n is an integer, then n is divisible by how many positive integers?

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

Intern
Joined: 27 Dec 2012
Posts: 11

### Show Tags

30 Jan 2013, 22:33
It took me just 15 seconds to solve this..
N is a product of 2 different prime nos.......then 1,n and dose two prime nos. are divisible by n ...hence 4 nos.
agen, 2^3 = 8, has 4 nos. from which it can be divided...agen n is divisible by 4 nos.
Hence, D
Intern
Joined: 28 Aug 2012
Posts: 46
Concentration: Operations, Marketing
GMAT 1: 510 Q36 V25
GPA: 4
WE: Information Technology (Other)
Re: If n is an integer, then n divisible by how many positive  [#permalink]

### Show Tags

31 Jan 2013, 13:10
@ Fozzzy
Statement 1 - n is the product of two different integers . They may be 2*3 or 3*7 or any two integers. Since they yield different products. We cannot determine the # of factors for n. Hence Statement 1 - Insufficient.
Statement 2 - n and 2^3 are each divisible by the same number of positive integers. 2^3 = 8. Having 4 factors (1,2,4,8) . Since the statement says n and 8 are divisible by the same num of integers. n=4. Hence Statement 2 - Sufficient

Hope this helps!
Cheers
Director
Joined: 29 Nov 2012
Posts: 722
if n is an integer then n is divisble by how many positive i  [#permalink]

### Show Tags

17 Jul 2013, 01:45
if n is an integer then n is divisble 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

Don't have OA. Please provide explanations! Thanks
Math Expert
Joined: 02 Sep 2009
Posts: 58117
Re: if n is an integer then n is divisble by how many positive i  [#permalink]

### Show Tags

17 Jul 2013, 01:50
fozzzy wrote:
if n is an integer then n is divisble 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

Don't have OA. Please provide explanations! Thanks

Merging similar topics. Please refer to the solution above and ask if anything remains unclear.

P.S. You've posted this question before: if-n-is-an-integer-then-n-divisible-by-how-many-positive-109670.html#p1175381
_________________
Non-Human User
Joined: 09 Sep 2013
Posts: 12399
Re: If n is an integer, then n divisible by how many positive  [#permalink]

### Show Tags

14 Aug 2018, 05:24
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
Re: If n is an integer, then n divisible by how many positive   [#permalink] 14 Aug 2018, 05:24
Display posts from previous: Sort by