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 Your Progress

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

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

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.

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

Re: If n is an integer, then n divisible by how many positive [#permalink]
31 Jan 2013, 12: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

Re: If n is an integer, then n divisible by how many positive [#permalink]
26 Aug 2014, 19:29

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

Hey everyone, today’s post focuses on the interview process. As I get ready for interviews at Kellogg and Tuck (and TheEngineerMBA ramps up for his HBS... ...

I got invited to interview at Sloan! The date is October 31st. So, with my Kellogg interview scheduled for this Wednesday morning, and my MIT Sloan interview scheduled...

Not all good communicators are leaders, but all leaders are good communicators. Communication is an essential tool that leaders need to use in order to get anything done. Almost...

Despite being a long weekend with Thanksgiving, this week was very tiring for me in various ways. Besides the pressure of learning materials I am not familiar with such...