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.
Could you pls give me a clearer explanation? Thanks so much.
5-Day Free Trial
5-day free, full-access trial TTP
Available with Beat the GMAT members only code
MORE DETAILS
Intergers from OG
This topic has expert replies
IMO, both are sufficient (D)
Stmt 1 - n is product of 2 PRIME nos (say x and y) so the no is divisible by 1, x, y and n. Total 4 nos. SUFF
Stmt 2 - 2^3 = 8 and 8 is divisble by 1, 2, 4 and 8. Total 4 nos. SUFF
Stmt 1 - n is product of 2 PRIME nos (say x and y) so the no is divisible by 1, x, y and n. Total 4 nos. SUFF
Stmt 2 - 2^3 = 8 and 8 is divisble by 1, 2, 4 and 8. Total 4 nos. SUFF
