post deleted

This topic has expert replies
Senior | Next Rank: 100 Posts
Posts: 52
Joined: Sat Sep 27, 2008 11:38 am
Location: Hyderabad
Thanked: 3 times

post deleted

by nandansingh » Thu Oct 30, 2008 11:59 pm
post deleted
Last edited by nandansingh on Fri Oct 31, 2008 9:57 am, edited 1 time in total.

Legendary Member
Posts: 1153
Joined: Wed Jun 20, 2007 6:21 am
Thanked: 146 times
Followed by:2 members
nandansingh wrote:How many different prime numbers are factors of positive integer n?
1.Four different prime numbers are factors of 2n.
2.Four different prime numbers are factors of n^2.

OA: b[/list]
Statement I
Four different prime numbers are factors of 2n

let n=3*5*7, prime factors 3
2n = 2*5*7*3, prime factors, 4

Let n= 2*3*5*7,prime factors 4
2n = 2*2*3*5*7, prime factors 4

Insufficient.

Statement II

if n^2 has four different factors, n will also have 4 different prime factors. Because when we square an integer we are actually raising the powers of its prime factors.

Sufficient.

Hence B.


Hope this helps.
No rest for the Wicked....

Master | Next Rank: 500 Posts
Posts: 496
Joined: Sun May 04, 2008 11:01 pm
Location: mumbai
Thanked: 7 times
GMAT Score:640

Re: Prime no. question (n,n^2) from prep1

by stubbornp » Fri Oct 31, 2008 12:25 am
nandansingh wrote:How many different prime numbers are factors of positive integer n?
1.Four different prime numbers are factors of 2n.
2.Four different prime numbers are factors of n^2.

OA: b[/list]

Stmt 1:We don't know whether N is odd or even...If

If N is odd,We are getting one more prime factor 2.

If N is even,We aleready have prime factor 2...-----Insufficient

Stmt 2:In case of n^2 has four different prime numbers,Then it is must that n has same # of prime factors---sufficient

B...hope it helps

Legendary Member
Posts: 2467
Joined: Thu Aug 28, 2008 6:14 pm
Thanked: 331 times
Followed by:11 members

by cramya » Fri Oct 31, 2008 4:59 am
B)

Parallel Chase's explanation is what I came up with also. With 2n's different prime factors we cant determine the different prime factors of n(2 could already be present in n or not hence stmt I is insufficient) but with n^2 we can(which will be the same as n's so sufficient)