If n=8p, where p is a prime number greater than 2, how many different positive even divisors does n have, including n ?
(A) 2
(B) 3
(C) 4
(D) 6
(E) 8
(A) 2
(B) 3
(C) 4
(D) 6
(E) 8
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.
n = 2^3*pkoby_gen wrote:If n=8p, where p is a prime number greater than 2, how many different positive even divisors does n have, including n ?
(A) 2
(B) 3
(C) 4
(D) 6
(E) 8
Another waykoby_gen wrote:If n=8p, where p is a prime number greater than 2, how many different positive even divisors does n have, including n ?
(A) 2
(B) 3
(C) 4
(D) 6
(E) 8
Sure.towerSpider wrote:Anshu, i didnt get your method. Can you explain?
We can plug in a value for p.koby_gen wrote:If n=8p, where p is a prime number greater than 2, how many different positive even divisors does n have, including n ?
(A) 2
(B) 3
(C) 4
(D) 6
(E) 8
Right, The part in bold is also the number of odd factors, as I have already posted in a post above :nipunkathuria wrote:Would like to add something over here:
N=x^p1*y^q1
where x and y are the prime factors of number N
the number of factors of the number N would be (p1+1)(q1+1)
But in our case the restriction has been that of Even factors.
Hence there will not be any role played by the p(for n=8*p) ...
hence we have 2^3=8 factors - (2^0*p and 2^0 * 1)
hence 6 factors
There is no other way that a larger prime number would result in a different outcome, because that would violate the question by admitting that there is more than one answer!Buix0065 wrote:Plugging in a prime > 2 for P, 3 would result in 24.
Even divisors of 24 are: 2, 4, 6, 8, 12, n
so I get 6.
Any insights on this methodology? Is there any way that a larger prime number would result in a different outcome?
New here Create free account