|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
16 Apr 2020, 03:43
Kudos
Bookmarks
D
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
15%
(low)
Question Stats:
80% (01:03) correct
20%
(01:12)
wrong
based on 336
sessions
History
Date
Time
Result
Not Attempted Yet
If n is a positive integer, is n divisible by at least six positive integers?
(1) n is the product of three different prime numbers
(2) n = 30
DS20556
(1) n is the product of three different prime numbers
(2) n = 30
DS20556
16 Apr 2020, 04:33
Kudos
Bookmarks
Bunuel
Solution
Step 1: Analyse Question Stem
- • n is a positive integer.
Step 2: Analyse Statements Independently (And eliminate options) – AD/BCE
Statement 1: n is the product of three different prime numbers.
- • \(n =p*q*r\), here p, q, and r are distinct prime integers
• Total number of factors of n = \((1+1)(1+1)(1+1)=2*2*2 =8\)
Statement 2: n = 30
Upon prime factorization of 30, we get
- • n= 2*3*5
• Total number of factor of \(n = (1+1)(1+1)(1+1)\)
- o We can find the number of factors of n.
Archit3110
16 Apr 2020, 08:20
Kudos
Bookmarks
Bunuel
#1
n is the product of three different prime numbers
a prime number has 2 +ve factors so 3 prime will have 6 factors sufficient
#2
n=30
n=2*3*5 ; total factors ; 6
sufficient
IMO D
