Live GMAT classes with Target Test Prep start Nov 21 and Nov 22. First class free.
See classesLearn live with an expert or move at your own pace. Every option includes the complete TTP study system.
Target Test Prep was voted #1 Best Test Prep in the 2026 Newsweek Readers’ Choice™ Awards.
with Josh Braslow, 20+ years in test prep
Self-paced EA prep. Study on your schedule.
with
Complete access from day one. Study on your schedule.
If n = 2*3*5, then n is divisible by 1, 2, 3, 5, 6 (=2*3), 10 (=2*5), 15 (=3*5) and 30 (=2*3*5) - eight different positive integers. In fact, if n is equal to the product of three different primes p, q and r, then n = pqr, and n must be divisible by:mehravikas wrote:Can you explain with an example please?
From my understanding, statement 1 is insufficient. Let n = 5 i.e. 5 * 3 * 2, in this case n is not divisible by 6 positive integers.
Ian Stewart wrote:If n = 2*3*5, then n is divisible by 1, 2, 3, 5, 6 (=2*3), 10 (=2*5), 15 (=3*5) and 30 (=2*3*5) - eight different positive integers. In fact, if n is equal to the product of three different primes p, q and r, then n = pqr, and n must be divisible by:mehravikas wrote:Can you explain with an example please?
From my understanding, statement 1 is insufficient. Let n = 5 i.e. 5 * 3 * 2, in this case n is not divisible by 6 positive integers.
1, p, q, r, pq, pr, qr, and pqr
All of these numbers must be different, because numbers have unique prime factorizations. Every number that has three distinct prime divisors has at least eight positive divisors. If n = pqr, where p, q and r are different primes, then n has precisely 8 divisors.
So each Statement is sufficient (the second statement is a special case of the first). D.
