GRE Prep 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.
If the integer n has exactly three positive divisors, includ
[#permalink]
14 Aug 2020, 11:04
14 Aug 2020, 11:04
Expert Reply
2
Bookmarks
00:00
Question Stats:
66% (00:56) correct
33% (00:47) wrong based on 30 sessions
Hide Show timer Statistics
If the integer n has exactly three positive divisors, including 1 and n, how many positive divisors does n^2 have?
(A) 4
(B) 5
(C) 6
(D) 8
(E) 9
(A) 4
(B) 5
(C) 6
(D) 8
(E) 9
Re: If the integer n has exactly three positive divisors, includ
[#permalink]
14 Aug 2020, 11:04
14 Aug 2020, 11:04
Expert Reply
Post A Detailed Correct Solution For The Above Questions And Get A Kudos.
Question From Our New Project: GRE Quant Challenge Questions Daily - NEW EDITION!
Question From Our New Project: GRE Quant Challenge Questions Daily - NEW EDITION!
Retired Moderator
Joined: 10 Apr 2015
Posts: 6218
Given Kudos: 136
Re: If the integer n has exactly three positive divisors, includ
[#permalink]
14 Aug 2020, 11:09
14 Aug 2020, 11:09
Carcass wrote:
If the integer n has exactly three positive divisors, including 1 and n, how many positive divisors does n^2 have?
(A) 4
(B) 5
(C) 6
(D) 8
(E) 9
(A) 4
(B) 5
(C) 6
(D) 8
(E) 9
APPROACH #1: Start testing values in order to locate one number that has exactly 3 positive divisors
1 has 1 positive divisor (1). No good.
2 has 2 positive divisors (1 and 2) No good.
3 has 2 positive divisors (1 and 3). No good.
4 has 3 positive divisors (1, 2 and 4). GREAT!
So it could be possible that n = 4
How many positive divisors does n² have?
n² = 4² = 16
The positive divisors of 16 are as follows: 1, 2, 4, 8, 16 (5 divisors)
Answer: B
---------------------------------------
APPROACH #2: Save a tiny bit of time by recognizing that n must be the square of an integer.
Useful properties:
If K is the square of an integer, then K will have an ODD number of positive divisors.
If K is NOT the square of an integer, then K will have an EVEN number of positive divisors.
We're told that n has exactly 3 positive divisors.
Since 3 is ODD, we know that n must be the square of an integer.
So, n COULD be 1 or 4 or 9 or 16 or 25 or.....
At this point, we need only check possible values of n that are squares of integers.
This, however, does not mean we can choose any square have an integer for the value of n. We still need to make sure that n has exactly 3 positive integers.
1 has 1 positive divisor (1). No good.
4 has 3 positive divisors (1, 2 and 4). GREAT!
From this point, our solution is exactly the same as the one covered in APPROACH #1.
Answer: B
Cheers,
Brent
