Last visit was: 26 Apr 2024, 21:27 It is currently 26 Apr 2024, 21:27

Close
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

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.
Close
Request Expert Reply
Confirm Cancel
SORT BY:
Date
Tags:
Show Tags
Hide Tags
User avatar
Manager
Manager
Joined: 23 Jan 2013
Posts: 99
Own Kudos [?]: 172 [17]
Given Kudos: 41
Concentration: Technology, Other
Schools: Berkeley Haas
GMAT Date: 01-14-2015
WE:Information Technology (Computer Software)
Send PM
Most Helpful Reply
Math Expert
Joined: 02 Sep 2009
Posts: 92948
Own Kudos [?]: 619263 [4]
Given Kudos: 81609
Send PM
General Discussion
Intern
Intern
Joined: 17 Mar 2019
Posts: 36
Own Kudos [?]: 20 [0]
Given Kudos: 24
Location: India
Send PM
Math Expert
Joined: 02 Sep 2009
Posts: 92948
Own Kudos [?]: 619263 [0]
Given Kudos: 81609
Send PM
How many different prime numbers are factors of the positive integer [#permalink]
Expert Reply
SomeOneUnique wrote:
Bunuel wrote:
shelrod007 wrote:
How many distinct prime divisors does a positive integer \(n\) have?

(1) \(2n\) has one distinct prime divisor.

(2) \(3n\) has one distinct prime divisor.

M18-37


How many different prime numbers are factors of the positive integer \(n\) ?

(1) \(2n\) has one prime factor.

Clearly, the sole prime factor of \(2n\) is 2. Thus, possible values for \(2n\) include 2, 4, 8, etc., implying \(n\) could be 1, 2, 4, and so forth. If \(n=1\), it doesn't have any prime factor, but if \(n\) takes any other value (2, 4, ...), it has one prime factor: 2. Not sufficient.

(2) \(3n\) has one prime factor.

The situation here mirrors the first: the only prime factor of \(3n\) is 3. Hence, \(3n\) could be 3, 9, 27, etc., which implies \(n\) could be 1, 3, 9, and so on. If \(n=1\), then it doesn't have a prime factor, but if \(n\) takes any other value (3, 9, ...), it has one prime factor: 3. Not sufficient.

(1)+(2) From above, the only possible value of \(n\) is 1, and 1 does not have any prime factors. Sufficient.


Answer: C




Hello,
I understand that n=1 is common case for both statements.
However, if we combine the 2 statements, we get 2n and 3n have 1 distinct prime divisor.
Isn't this ambiguous ?


When we combine the statements, we conclude that n = 1. Therefore, (1) indicates that 2n = 2 has one prime factor, which is accurate: 2 has one prime factor, 2 itself. Similarly, (2) implies that 3n = 3 has one prime factor, which is correct: 3 has one prime factor, 3 itself.
GMAT Club Bot
How many different prime numbers are factors of the positive integer [#permalink]
Moderator:
Math Expert
92948 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne