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.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

If the product of all the unique positive divisors of n, a p [#permalink]
02 Feb 2011, 11:03

5

This post received KUDOS

17

This post was BOOKMARKED

00:00

A

B

C

D

E

Difficulty:

95% (hard)

Question Stats:

23% (03:09) correct
77% (01:52) wrong based on 1169 sessions

If the product of all the unique positive divisors of n, a positive integer which is not a perfect cube, is n^2, then the product of all the unique positive divisors of n^2 is

Re: Divisibility Question [#permalink]
02 Feb 2011, 11:46

8

This post received KUDOS

Expert's post

5

This post was BOOKMARKED

gmatpapa wrote:

If the product of all the unique positive divisors of n, a positive integer which is not a perfect cube, is n^2, then the product of all the unique positive divisors of n^2 is (A) n^3 (B) n^4 (C) n^6 (D) n^8 (E) n^9

All positive integers n which equal to n=p_1*p_2, where p_1 and p_2 are distinct primes satisfy the condition in the stem. Because the factors of n in this case would be: 1, p_1, p_2, and n itself, so the product of the factors will be 1*(p_1*p_2)*n=n^2.

(Note that if n=p^3 where p is a prime number also satisfies this condition as the factors of n in this case would be 1, p, p^2 and n itself, so the product of the factors will be 1*(p*p^2)*n=p^3*n=n^2, but we are told that n is not a perfect cube, so this case is out, as well as the case n=1.)

For example if n=6=2*3 --> the product of all the unique positive divisors of 6 will be: 1*2*3*6=6^2; Or if n=10=2*5 --> the product of all the unique positive divisors of 10 will be: 1*2*5*10=10^2;

Now, take n=10 --> n^2=100 --> the product of all the unique positive divisors of 100 is: 1*2*4*5*10*20*25*50*100=(2*50)*(4*25)*(5*20)*10*100=10^2*10^2*10^2*10*10^2=10^9 (you can do this with formula to get (p_1)^9*(p_2)^9=n^9 but think this way is quicker).

Re: Divisibility Question [#permalink]
02 Feb 2011, 19:57

25

This post received KUDOS

2

This post was BOOKMARKED

I agree with E: n^9.

Another way to look at it (using the same methodology outlined by Bunuel in his post):

We know that the product of all the divisors of n is equivalent to n^2. Therefore, n = x * y, where x and y are both prime positive and distinct integers (as outlined by the conditions set in the original question, and explained in the previous post).

We need to determine, the product of all the divisors of n^2, which we know to be equivalent to:

n^2 = n * n

n^2 = (x * y)(x * y)

Since both x and y are known to be prime numbers, the divisors of n^2 are therefore:

Re: Divisibility Question [#permalink]
02 Feb 2011, 20:09

4

This post received KUDOS

Expert's post

2

This post was BOOKMARKED

gmatpapa wrote:

If the product of all the unique positive divisors of n, a positive integer which is not a perfect cube, is n^2, then the product of all the unique positive divisors of n^2 is (A) n^3 (B) n^4 (C) n^6 (D) n^8 (E) n^9

My take on it is following: If I can find one example such that 'product of all the unique positive divisors of n is n^2' (n not a perfect cube), I will just find the product of all unique positive divisors of n^2 and get the answer.

So what do the factors of n listed out look like? 1 .. .. .. .. n

1 and n are definitely factors of n so out of the required product,n^2, one n is already accounted for. I need only one more n and hence I must have 2 factors in the middle. e.g. 1, 2, 3, 6 (6 is not a perfect cube but product of all factors of 6 is 36. So I got the one example I was looking for.) 36 = 2^2*3^2 So it will have 9 factors. Four pairs of factors equidistant from the beg and end will give the product 36 (i.e. n^2). Factor in the middle will be 6 i.e. n. Hence product of all factors of 36 will be n^8*n = n^9.

Re: Divisibility Question [#permalink]
03 Feb 2011, 01:04

I think I misunderstood the question..

I picked the example of n=10=2^1*5^1. Unique divisors: 2, 5, 10 and their product is 100 which is n^2. Unique divisors of 100 are 1,2,4,5,10,20,50,100, the product of these equal 2^9*5^9. The mistake I committed was i divided this product by n, landing at (2^9*5^9)/(2^1*5^1)= 2^8*5^8= n^8, and then losing my sleep over the wrong answer lol GMAT mode, what can I say!

Thanks for your explanation guys! _________________

Re: Divisibility Question [#permalink]
11 Mar 2012, 03:46

Expert's post

Bunuel wrote:

gmatpapa wrote:

If the product of all the unique positive divisors of n, a positive integer which is not a perfect cube, is n^2, then the product of all the unique positive divisors of n^2 is (A) n^3 (B) n^4 (C) n^6 (D) n^8 (E) n^9

All positive integers n which equal to n=p_1*p_2, where p_1 and p_2 are distinct primes satisfy the condition in the stem. Because the factors of n in this case would be: 1, p_1, p_2, and n itself, so the product of the factors will be 1*(p_1*p_2)*n=n^2.

(Note that if n=p^3 where p is a prime number also satisfies this condition as the factors of n in this case would be 1, p, p^2 and n itself, so the product of the factors will be 1*(p*p^2)*n=p^3*n=n^2, but we are told that n is not a perfect cube, so this case is out, as well as the case n=1.)

For example if n=6=2*3 --> the product of all the unique positive divisors of 6 will be: 1*2*3*6=6^2; Or if n=10=2*5 --> the product of all the unique positive divisors of 10 will be: 1*2*5*10=10^2;

Now, take n=10 --> n^2=100 --> the product of all the unique positive divisors of 100 is: 1*2*4*5*10*20*25*50*100=(2*50)*(4*25)*(5*20)*10*100=10^2*10^2*10^2*10*10^2=10^9 (you can do this with formula to get (p_1)^9*(p_2)^9=n^9 but think this way is quicker).

Answer: E.

For me when we deal with this kind of problems is important to find a clue and here is that the number n is NOT a perfect cube.

So, a NOT perfect CUBE is a number when the exponents of our number are not 3 or multiple of 3 (the same reasoning is for perfect square contains only even powers of primes, otherwise is not a perfect square).

In this scenario at glance I purge B C and D. From A and E are the only answer where the LENGTH of the total number of primes in the prime box of integer N, so n^3 is not possible. The answer is E

This is correct?? I 'd like an opinion o explenation about that. Is unclear for me if this process is totally correct or no...

Re: Divisibility Question [#permalink]
11 Mar 2012, 20:06

1

This post received KUDOS

Expert's post

carcass wrote:

For me when we deal with this kind of problems is important to find a clue and here is that the number n is NOT a perfect cube.

So, a NOT perfect CUBE is a number when the exponents of our number are not 3 or multiple of 3 (the same reasoning is for perfect square contains only even powers of primes, otherwise is not a perfect square).

In this scenario at glance I purge B C and D. From A and E are the only answer where the LENGTH of the total number of primes in the prime box of integer N, so n^3 is not possible. The answer is E

This is correct?? I 'd like an opinion o explenation about that. Is unclear for me if this process is totally correct or no...

Thanks.

I am unable to understand your reasoning for rejecting (B), (C) and (D). Since the product of all factors is n^2 and factors equidistant from the beginning and end multiply to give n, we know we have 2 pairs of factors. 1, a, b, n (1*n gives n and a*b gives n) The reason they gave that n is not a perfect cube is to reject the scenario where b is just the square of a e.g. to reject this scenario: 1, 2, 4, 8 So basically, the question is telling you that a and b are primes and n is the product of a and b e.g. 1, 2, 5, 10 _________________

Re: Divisibility Question [#permalink]
12 Mar 2012, 04:21

Expert's post

VeritasPrepKarishma wrote:

carcass wrote:

For me when we deal with this kind of problems is important to find a clue and here is that the number n is NOT a perfect cube.

So, a NOT perfect CUBE is a number when the exponents of our number are not 3 or multiple of 3 (the same reasoning is for perfect square contains only even powers of primes, otherwise is not a perfect square).

In this scenario at glance I purge B C and D. From A and E are the only answer where the LENGTH of the total number of primes in the prime box of integer N, so n^3 is not possible. The answer is E

This is correct?? I 'd like an opinion o explenation about that. Is unclear for me if this process is totally correct or no...

Thanks.

I am unable to understand your reasoning for rejecting (B), (C) and (D). Since the product of all factors is n^2 and factors equidistant from the beginning and end multiply to give n, we know we have 2 pairs of factors. 1, a, b, n (1*n gives n and a*b gives n) The reason they gave that n is not a perfect cube is to reject the scenario where b is just the square of a e.g. to reject this scenario: 1, 2, 4, 8 So basically, the question is telling you that a and b are primes and n is the product of a and b e.g. 1, 2, 5, 10

Thanks Infact I said that is unclear if my reasoning was right or wrong.

Now is more clear thanks to you . _________________

Re: Divisibility Question [#permalink]
16 May 2013, 21:00

1

This post received KUDOS

VeritasPrepKarishma wrote:

gmatpapa wrote:

If the product of all the unique positive divisors of n, a positive integer which is not a perfect cube, is n^2, then the product of all the unique positive divisors of n^2 is (A) n^3 (B) n^4 (C) n^6 (D) n^8 (E) n^9

My take on it is following: If I can find one example such that 'product of all the unique positive divisors of n is n^2' (n not a perfect cube), I will just find the product of all unique positive divisors of n^2 and get the answer.

So what do the factors of n listed out look like? 1 .. .. .. .. n

1 and n are definitely factors of n so out of the required product,n^2, one n is already accounted for. I need only one more n and hence I must have 2 factors in the middle. e.g. 1, 2, 3, 6 (6 is not a perfect cube but product of all factors of 6 is 36. So I got the one example I was looking for.) 36 = 2^2*3^2 So it will have 9 factors. Four pairs of factors equidistant from the beg and end will give the product 36 (i.e. n^2). Factor in the middle will be 6 i.e. n. Hence product of all factors of 36 will be n^8*n = n^9.

product of factors of n = n^2 implies n^(f/2) = n^2 where f is no. of factors here f= 4. So obviously along with 1 and n, we do have 2 more factors. let say x,y (prime factors) i.e, 1*x*y*n =n^2 ==> x*y=n n^2 = x^2*y^2 Now the product of all factors of n^2 = (n^2)^(g/2) where g = no. of factors of n^2 we know g=(2+1)(2+1) =9 As n^2 is a perfect square , product of factors of n^2 will be n^9

Re: Divisibility Question [#permalink]
08 Jun 2013, 10:58

VeritasPrepKarishma wrote:

gmatpapa wrote:

1 and n are definitely factors of n so out of the required product,n^2, one n is already accounted for. I need only one more n and hence I must have 2 factors in the middle. e.g. 1, 2, 3, 6 (6 is not a perfect cube but product of all factors of 6 is 36. So I got the one example I was looking for.) 36 = 2^2*3^2

Can you please explain how you reached to the conclusion that you must have 2 factors in the middle ??

Re: Divisibility Question [#permalink]
09 Jun 2013, 21:55

Expert's post

atilarora wrote:

VeritasPrepKarishma wrote:

gmatpapa wrote:

1 and n are definitely factors of n so out of the required product,n^2, one n is already accounted for. I need only one more n and hence I must have 2 factors in the middle. e.g. 1, 2, 3, 6 (6 is not a perfect cube but product of all factors of 6 is 36. So I got the one example I was looking for.) 36 = 2^2*3^2

Can you please explain how you reached to the conclusion that you must have 2 factors in the middle ??

When you write down all factors of n in increasing order, you notice that factors equidistant from the two ends have the product n.

So if the product of all factors is n^2, you will get one n from 1*n. Then there must be two factors in the middle which multiply to give another n. (Note that this is not valid for perfect squares. Check out this post: http://www.veritasprep.com/blog/2010/12 ... t-squares/) _________________

Re: Divisibility Question [#permalink]
20 Aug 2013, 23:26

ButwhY wrote:

VeritasPrepKarishma wrote:

gmatpapa wrote:

If the product of all the unique positive divisors of n, a positive integer which is not a perfect cube, is n^2, then the product of all the unique positive divisors of n^2 is (A) n^3 (B) n^4 (C) n^6 (D) n^8 (E) n^9

My take on it is following: If I can find one example such that 'product of all the unique positive divisors of n is n^2' (n not a perfect cube), I will just find the product of all unique positive divisors of n^2 and get the answer.

So what do the factors of n listed out look like? 1 .. .. .. .. n

1 and n are definitely factors of n so out of the required product,n^2, one n is already accounted for. I need only one more n and hence I must have 2 factors in the middle. e.g. 1, 2, 3, 6 (6 is not a perfect cube but product of all factors of 6 is 36. So I got the one example I was looking for.) 36 = 2^2*3^2 So it will have 9 factors. Four pairs of factors equidistant from the beg and end will give the product 36 (i.e. n^2). Factor in the middle will be 6 i.e. n. Hence product of all factors of 36 will be n^8*n = n^9.

product of factors of n = n^2 implies n^(f/2) = n^2 where f is no. of factors here f= 4. So obviously along with 1 and n, we do have 2 more factors. let say x,y (prime factors) i.e, 1*x*y*n =n^2 ==> x*y=n n^2 = x^2*y^2 Now the product of all factors of n^2 = (n^2)^(g/2) where g = no. of factors of n^2 we know g=(2+1)(2+1) =9 As n^2 is a perfect square , product of factors of n^2 will be n^9

Hi,

i have a doubt in this product of all factors of n^2 = (n^2)^(g/2) where g = no. of factors of n^2

If the product of all the unique positive divisors of n, a positive integer which is not a perfect cube, is n^2, then the product of all the unique positive divisors of n^2 is (A) n^3 (B) n^4 (C) n^6 (D) n^8 (E) n^9

My take on it is following: If I can find one example such that 'product of all the unique positive divisors of n is n^2' (n not a perfect cube), I will just find the product of all unique positive divisors of n^2 and get the answer.

So what do the factors of n listed out look like? 1 .. .. .. .. n

1 and n are definitely factors of n so out of the required product,n^2, one n is already accounted for. I need only one more n and hence I must have 2 factors in the middle. e.g. 1, 2, 3, 6 (6 is not a perfect cube but product of all factors of 6 is 36. So I got the one example I was looking for.) 36 = 2^2*3^2 So it will have 9 factors. Four pairs of factors equidistant from the beg and end will give the product 36 (i.e. n^2). Factor in the middle will be 6 i.e. n. Hence product of all factors of 36 will be n^8*n = n^9.

I have no doubt in theory, still couldn't understand this- "So it will have 9 factors. Four pairs of factors equidistant from the beg and end will give the product 36 (i.e. n^2). Factor in the middle will be 6 i.e. n. Hence product of all factors of 36 will be n^8*n = n^9." _________________

Re: If the product of all the unique positive divisors of n, a p [#permalink]
05 Nov 2013, 07:39

gmatpapa wrote:

If the product of all the unique positive divisors of n, a positive integer which is not a perfect cube, is n^2, then the product of all the unique positive divisors of n^2 is

(A) n^3 (B) n^4 (C) n^6 (D) n^8 (E) n^9

Product of factors of n= n^(f/2) (f=number of factors) =>n^(f/2) =n^2 =>f=4 =>n=p1^1*p2^1 (this is the way we can get f=4. If n were a cube then n could have been p1^3 which could have resulted f=4 as well.)

Now question asks product of divisors of n^2. =>n^2=p1^2*p2^2 =>total factors for n^2=(2+1)(2+1)=9 =>Product of divisors of n^2 = (n^2)(f/2) =(n^2)(9/2) =n^9

Re: If the product of all the unique positive divisors of n, a p [#permalink]
15 Jan 2014, 07:22

the product of factors of a number 'n' would be (n)^(no.of factors/2).given the product of all the unique divisors is n^2.so we can conclude no.of factors for the given number is 4.such numbers would be of the form (p1)^1*(p2)^1 where p1 and p2 are prime numbers. n=(p1)^1*(p2)^1 n^2=(p1)^2*(p2)^2 . product of all the factors of n^2 would be (n^2)^(no.of factors of n^2/2)=(n^2)^(3*3/2)=n^9 _________________

Re: If the product of all the unique positive divisors of n, a p [#permalink]
29 Apr 2014, 22:25

gmatpapa wrote:

If the product of all the unique positive divisors of n, a positive integer which is not a perfect cube, is n^2, then the product of all the unique positive divisors of n^2 is

(A) n^3 (B) n^4 (C) n^6 (D) n^8 (E) n^9

Could solve this in under 2min by below approach Easy one, if you assume a proper number .Lets suppose the number is n= 6. The number is not a perfect cube. n^2 = 36 Find the divisors of 36 :- 2,3,4,6,9,12,18,36 :- Now multiply them all [You don't need to multiply them. Just re-arrange them in multiples of 6] . 2*3*4*6*9*12*18*36 = 6*6*6*6*6*6*6*6*6 = 6^9 or n^9 . "E"

Re: If the product of all the unique positive divisors of n, a p [#permalink]
01 Aug 2014, 18:00

AKProdigy87 wrote:

I agree with E: n^9.

Another way to look at it (using the same methodology outlined by Bunuel in his post):

We know that the product of all the divisors of n is equivalent to n^2. Therefore, n = x * y, where x and y are both prime positive and distinct integers (as outlined by the conditions set in the original question, and explained in the previous post).

We need to determine, the product of all the divisors of n^2, which we know to be equivalent to:

n^2 = n * n

n^2 = (x * y)(x * y)

Since both x and y are known to be prime numbers, the divisors of n^2 are therefore:

1, x, y, xy, x^2, y^2, x^2y, xy^2, and x^2y^2

The product of these divisors is therefore:

(1)(x)(y)(xy)(x^2)(y^2)(x^2y)(xy^2)(x^2y^2)

= x^9y^9

= n^9

It saves more time than trying a real number ( in my opinion) your exp is so helpful. + 1 kudos _________________

......................................................................... +1 Kudos please, if you like my post

gmatclubot

Re: If the product of all the unique positive divisors of n, a p
[#permalink]
01 Aug 2014, 18:00

*PHEW*. Do you sometimes have that feeling where you try and cram as much as is humanly possible in the 24 hours that constitute a day and that time...

Ah yes. Funemployment. The time between when you quit your job and when you start your MBA. The promised land that many MBA applicants seek. The break that every...

It is that time of year again – time for Clear Admit’s annual Best of Blogging voting. Dating way back to the 2004-2005 application season, the Best of Blogging...