OG 11th Edition PS#241-Need explanation : PS Archive
Check GMAT Club Decision Tracker for the Latest School Decision Releases https://gmatclub.com/AppTrack

 It is currently 26 Feb 2017, 12:00

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# OG 11th Edition PS#241-Need explanation

Author Message
Manager
Joined: 04 Dec 2008
Posts: 104
Followers: 2

Kudos [?]: 179 [0], given: 2

OG 11th Edition PS#241-Need explanation [#permalink]

### Show Tags

02 Apr 2009, 19:16
1
This post was
BOOKMARKED
00:00

Difficulty:

(N/A)

Question Stats:

100% (01:46) correct 0% (00:00) wrong based on 4 sessions

### HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

If the integer n has exactly 3 positive divisors, including 1 and n, how many positive divisors does n^2 have?

(A) 4
(B) 5
(C) 6
(D) 8
(E) 9

I don't understand why answer is B. Book explanation not clear.
Thanks!

Last edited by joyseychow on 29 Apr 2009, 01:35, edited 1 time in total.
Senior Manager
Joined: 01 Mar 2009
Posts: 372
Location: PDX
Followers: 6

Kudos [?]: 90 [0], given: 24

Re: OG 11th Edition PS#214-Need explanation [#permalink]

### Show Tags

02 Apr 2009, 20:27
If an integer is to have just 3 factors including one and itself: it has to be the square of a prime.

So n is the square of a prime = 3^2 = 9
n^2 = 9^2 = 81

81 has 5 factors, 1, 81, 3, 9 and 27.

The same applies to all prime numbers. Hope this helps.

_________________

In the land of the night, the chariot of the sun is drawn by the grateful dead

Manager
Joined: 04 Dec 2008
Posts: 104
Followers: 2

Kudos [?]: 179 [0], given: 2

Re: OG 11th Edition PS#214-Need explanation [#permalink]

### Show Tags

03 Apr 2009, 05:55
pbanavara wrote:
If an integer is to have just 3 factors including one and itself: it has to be the square of a prime.

So n is the square of a prime = 3^2 = 9
n^2 = 9^2 = 81

81 has 5 factors, 1, 81, 3, 9 and 27.

The same applies to all prime numbers. Hope this helps.

Thanks pradeep for the explanation! Learn something today.
Intern
Joined: 14 Jun 2009
Posts: 3
Followers: 0

Kudos [?]: 0 [0], given: 0

Re: OG 11th Edition PS#241-Need explanation [#permalink]

### Show Tags

18 Aug 2009, 22:12
thanks, that makes waaay more sense
Manager
Joined: 14 Aug 2009
Posts: 123
Followers: 2

Kudos [?]: 104 [0], given: 13

Re: OG 11th Edition PS#241-Need explanation [#permalink]

### Show Tags

18 Aug 2009, 22:34
If the integer n has exactly 3 positive divisors, including 1 and n, how many positive divisors does n^2 have?

From the question, we can get the divisors are:
1, t, n and n=t^2

therefore, for n^2=n*n, it will have 1, t, n, t*n, and n^2 as the divisors.

thus the answer is B) 5.
_________________

Kudos me if my reply helps!

Manager
Joined: 15 Apr 2008
Posts: 165
Followers: 2

Kudos [?]: 12 [0], given: 1

Re: OG 11th Edition PS#241-Need explanation [#permalink]

### Show Tags

19 Aug 2009, 06:06
flyingbunny wrote:
If the integer n has exactly 3 positive divisors, including 1 and n, how many positive divisors does n^2 have?

From the question, we can get the divisors are:
1, t, n and n=t^2

therefore, for n^2=n*n, it will have 1, t, n, t*n, and n^2 as the divisors.

thus the answer is B) 5.

hey can you explain how you got this part (in color)
Manager
Joined: 14 Aug 2009
Posts: 123
Followers: 2

Kudos [?]: 104 [0], given: 13

Re: OG 11th Edition PS#241-Need explanation [#permalink]

### Show Tags

19 Aug 2009, 06:27
ALD wrote:
flyingbunny wrote:
If the integer n has exactly 3 positive divisors, including 1 and n, how many positive divisors does n^2 have?

From the question, we can get the divisors are:
1, t, n and n=t^2

therefore, for n^2=n*n, it will have 1, t, n, t*n, and n^2 as the divisors.

thus the answer is B) 5.

hey can you explain how you got this part (in color)

$$n^2=n*n$$
and $$n=t^2$$

therefore $$n^2=n*n=t*t*n$$
_________________

Kudos me if my reply helps!

Director
Joined: 25 Oct 2008
Posts: 608
Location: Kolkata,India
Followers: 13

Kudos [?]: 822 [0], given: 100

Re: OG 11th Edition PS#241-Need explanation [#permalink]

### Show Tags

26 Aug 2009, 02:13
I dont understand the concept that if a no. has 3 positive divisors it is a perfect sq..HOW???WHY??
We know..
most nos. have even no. od divisors.
prime nos. have exactly 2 divisors,1 and itself..

Can someone follow the same reasonung and explain the concept to me?
_________________

http://gmatclub.com/forum/countdown-beginshas-ended-85483-40.html#p649902

Manager
Joined: 28 Jul 2009
Posts: 154
Followers: 3

Kudos [?]: 184 [0], given: 4

Re: OG 11th Edition PS#241-Need explanation [#permalink]

### Show Tags

26 Aug 2009, 04:31
tejal777 wrote:
I dont understand the concept that if a no. has 3 positive divisors it is a perfect sq..HOW???WHY??
We know..
most nos. have even no. od divisors.
prime nos. have exactly 2 divisors,1 and itself..

Can someone follow the same reasonung and explain the concept to me?

Let's see..
the number N has EXACTLY 3 devisors: 1, x and itself N. (1<x<N)
If we devide N by x, we get ... another x. (no 1, no N, no another y - as y is fourth devisor). Any N/x=x
4/2=2 ... 9/3=3...
This x is a prime, coz if not then N would have more then 3 devisors

Hope to pour a light on this issue)
CEO
Joined: 17 Nov 2007
Posts: 3589
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 556

Kudos [?]: 3680 [0], given: 360

Re: OG 11th Edition PS#241-Need explanation [#permalink]

### Show Tags

26 Aug 2009, 04:55
There is a formula for the number of positive divisors for x:

N = (1+n)*(1+m).... where, x = a^n*b^m....(a, b - prime numbers)

So, in this question: 3=(1+n)(1+m).... it is only possible when n=2 (or m=2...) and other numbers equals 0.

For x^2 = a^2n*b^2m... and N (for x^2) = (1+2n)(1+2m)... = (1+2*2)*1... = 5.
_________________

HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android) - The OFFICIAL GMAT CLUB PREP APP, a must-have app especially if you aim at 700+ | PrepGame

Manager
Joined: 25 Aug 2009
Posts: 176
Followers: 1

Kudos [?]: 89 [0], given: 12

Re: OG 11th Edition PS#241-Need explanation [#permalink]

### Show Tags

26 Aug 2009, 10:54
let 1, n1, n are the 3 factors of n, then n^2 will have factors:-

1,n1,n1^2,n,n^2.

Consider n^2 as n * n So, if n1 is a factos of n then , it will also be a factor of n^2. Similarly, we have 2 n's in n^2, so n1^2 will also be a factor of n^2.

Re: OG 11th Edition PS#241-Need explanation   [#permalink] 26 Aug 2009, 10:54
Display posts from previous: Sort by