Summer is Coming! Join the Game of Timers Competition to Win Epic Prizes. Registration is Open. Game starts Mon July 1st.

It is currently 18 Jul 2019, 02:29

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

If p is an integer, then p is divisible by how many positive integers?

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Find Similar Topics 
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 56261
If p is an integer, then p is divisible by how many positive integers?  [#permalink]

Show Tags

New post 22 Aug 2018, 01:19
1
4
00:00
A
B
C
D
E

Difficulty:

  15% (low)

Question Stats:

80% (01:10) correct 20% (01:38) wrong based on 76 sessions

HideShow timer Statistics


NUS School Moderator
User avatar
D
Joined: 18 Jul 2018
Posts: 981
Location: India
Concentration: Finance, Marketing
WE: Engineering (Energy and Utilities)
Premium Member Reviews Badge CAT Tests
If p is an integer, then p is divisible by how many positive integers?  [#permalink]

Show Tags

New post Updated on: 22 Aug 2018, 01:27
1
1
From statement 1: P = 2^x. X can be 2,3,5,7 etc. Then P will be 4,8,32,128. Therefore the number of positive integers is not same. Hence 1 is insufficient.

From statement 2: P = x^2. X is a prime. Then X can take values 2,3,5,7 etc..
Then P = 4,9,25,49 and so on. In all such cases P has only 3 positive integers.
Example 4 has 1,2 and 4 as factors.
9 has 1,3 and 9 has factors.
Hence B is sufficient.

B is the answer.

Posted from my mobile device
_________________
Press +1 Kudos If my post helps!

Originally posted by Chethan92 on 22 Aug 2018, 01:26.
Last edited by Chethan92 on 22 Aug 2018, 01:27, edited 1 time in total.
VP
VP
User avatar
D
Joined: 31 Oct 2013
Posts: 1392
Concentration: Accounting, Finance
GPA: 3.68
WE: Analyst (Accounting)
If p is an integer, then p is divisible by how many positive integers?  [#permalink]

Show Tags

New post 22 Aug 2018, 01:26
Bunuel wrote:
If p is an integer, then p is divisible by how many positive integers?

(1) \(p = 2^x\) , where x is a prime number.
(2) \(p = x^2\) , where x is a prime number.



we are looking for the number of factors of p.

Statement 1: \(p = 2^x\) , where x is prime. check it.

\(p = 2^2 or 2^3 or 2^5\)

when \(2^2\), number of factors will be 2 + 1 = 3

when \(2^3\) , number of factors will be 3 + 1 = 4.

So, Not sufficient.

Statement 2:\(p = x^2\), x is a prime.

\(2^2 or 3^2 or 5^2\).

when \(2^2\) , factors = 2 + 1 = 3

when \(3^2\) factors = 2 + 1 = 3.

Sufficient.

The best answer is B.
VP
VP
User avatar
D
Status: Learning stage
Joined: 01 Oct 2017
Posts: 1028
WE: Supply Chain Management (Energy and Utilities)
Re: If p is an integer, then p is divisible by how many positive integers?  [#permalink]

Show Tags

New post 22 Aug 2018, 01:34
Bunuel wrote:
If p is an integer, then p is divisible by how many positive integers?

(1) p = 2^x, where x is a prime number.
(2) p = x^2, where x is a prime number.


St1:- p = 2^x, where x is a prime number
Possible values of p: \(2^2,2^3,2^5,2^7\)
No of factors of p: 3,4,6,8 etc.
Insufficient

St2:- p = x^2, where x is a prime number
Here x can't be factorized further and power of x is a constant.
Hence, the no of factors is constant i.e, 3.
Sufficient.

Ans. (B)
_________________
Regards,

PKN

Rise above the storm, you will find the sunshine
Veritas Prep Representative
User avatar
S
Joined: 26 Jul 2010
Posts: 414
If p is an integer, then p is divisible by how many positive integers?  [#permalink]

Show Tags

New post 22 Aug 2018, 10:53
1
Top Contributor
For those who know the "Unique Factors Trick" statement 2 should be really quick without any number picking. In the Unique Factors Trick you break a number down to its primes and express them as exponents (so like 12 = 2^2 * 3^1), then add 1 to each exponent and multiply the exponents together (so with 12 = 2^2 * 3^1 you'd add 1 to each exponent and have (2+1)(1+1) = 3 * 2 = 6 factors (and those factors are 1, 2, 3, 4, 6, and 12).

Well here even if you don't know x, you do know that it's prime, so you've already taken the first step of the Unique Factors Trick: you have its prime base, x, taken to an exponent. Just add one to that exponent and you're set. x^2 --> 2 + 1 factors = 3 factors.

For this one, too, it's not a bad idea to know the "rule" of statement 1 in reverse: if an integer has exactly three unique factors, it's the square of a prime number.
_________________
Brian

Curriculum Developer, Instructor, and Host of Veritas Prep On Demand

Save $100 on live Veritas Prep GMAT Courses and Admissions Consulting

Enroll now. Pay later. Take advantage of Veritas Prep's flexible payment plan options.

Veritas Prep Reviews
GMAT Club Bot
If p is an integer, then p is divisible by how many positive integers?   [#permalink] 22 Aug 2018, 10:53
Display posts from previous: Sort by

If p is an integer, then p is divisible by how many positive integers?

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  





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