Last visit was: 24 Apr 2024, 02:53 It is currently 24 Apr 2024, 02:53

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
SORT BY:
Date
Math Expert
Joined: 02 Sep 2009
Posts: 92901
Own Kudos [?]: 618684 [41]
Given Kudos: 81586
Send PM
Most Helpful Reply
Math Expert
Joined: 02 Sep 2009
Posts: 92901
Own Kudos [?]: 618684 [13]
Given Kudos: 81586
Send PM
General Discussion
Intern
Intern
Joined: 08 Jan 2015
Posts: 48
Own Kudos [?]: 52 [0]
Given Kudos: 53
Send PM
Intern
Intern
Joined: 09 Aug 2013
Posts: 10
Own Kudos [?]: [0]
Given Kudos: 176
Location: India
Schools: IIMA
GMAT 1: 660 Q49 V31
GPA: 4
Send PM
Re: M28-02 [#permalink]
In option 2, if we take X=1 ,then total no. of positive divisor of x3 is 1, which is multiple of total number of positive divisors of y2.
Then the option should be E.
Please correct me
Math Expert
Joined: 02 Sep 2009
Posts: 92901
Own Kudos [?]: 618684 [0]
Given Kudos: 81586
Send PM
Re: M28-02 [#permalink]
Expert Reply
ravirjn wrote:
In option 2, if we take X=1 ,then total no. of positive divisor of x3 is 1, which is multiple of total number of positive divisors of y2.
Then the option should be E.
Please correct me


1 is not a multiple of 9, it's a divisor of 9.
RSM Erasmus Moderator
Joined: 26 Mar 2013
Posts: 2462
Own Kudos [?]: 1360 [0]
Given Kudos: 641
Concentration: Operations, Strategy
Schools: Erasmus (II)
Send PM
Re: M28-02 [#permalink]
Bunuel wrote:
Official Solution:


If \(x\) and \(y\) are positive integers, is the total number of positive divisors of \(x^3\) a multiple of the total number of positive divisors of \(y^2\)?

Finding the Number of Factors of an Integer

First make prime factorization of an integer \(n=a^p*b^q*c^r\), where \(a\), \(b\), and \(c\) are prime factors of \(n\) and \(p\), \(q\), and \(r\) are their powers.

The number of factors of \(n\) will be expressed by the formula \((p+1)(q+1)(r+1)\). NOTE: this will include 1 and n itself.

Example: Finding the number of all factors of 450: \(450=2^1*3^2*5^2\)

Total number of factors of 450 including 1 and 450 itself is \((1+1)*(2+1)*(2+1)=2*3*3=18\) factors.

(1) \(x=4\). From this statement we have that\(x^3=64=2^6\), thus the number of factors of 64 is 6+1=7.

Now, may \(y^2\) have the number of factors which is factor of 7, so 1 or 7 factors? Well may have or may not. Number of factors of a perfect square is odd. So \(y^2\) should have either 1 factor (for example if y^2=1^2) or 7 (for example if y^2=27^2=3^6 or y^2=8^2=2^6), both are possible, BUT \(y^2\) can have other odd number of factors say 3 (for example if y=5^2) and 3 is not factor of 7. Not sufficient

(2) \(y=6\). From that: \(y^2=36=2^2*3^2\), thus the number of factors of 36 is (2+1)*(2+1)=9.

Can \(x^3\) have the number of factors which is multiple of 9 (9, 18, 27, ...)? Let's represent \(x\) as the product of its prime factors: \(x^3=(a^p*b^q*c^r)^3=a^{3p}*b^{3q}*c^{3r}\). The number of factors would be \((3p+1)(3q+1)(3r+1)\) and this should be multiple of 9. BUT \((3p+1)(3q+1)(3r+1)\) is not divisible by 3, hence it can not be multiple of 9. The answer is NO. Sufficient.

Not to complicate \(x^3\) has \(3k+1>\) number of distinct factors (1, 4, 7, 10, ... odd or even number), so the number of factors of \(x^3\) is 1 more than a multiple of 3, thus it's not divisible by 3 and hence not by 9.


Answer: B



Dear Bunuel

Does the formula of total factor have limitation? it does not work for 1? If I apply the rule for 1 it will yield 2 factors which is wrong.

can you clarify please?
Math Expert
Joined: 02 Sep 2009
Posts: 92901
Own Kudos [?]: 618684 [0]
Given Kudos: 81586
Send PM
Re: M28-02 [#permalink]
Expert Reply
Mo2men wrote:
Bunuel wrote:
Official Solution:


If \(x\) and \(y\) are positive integers, is the total number of positive divisors of \(x^3\) a multiple of the total number of positive divisors of \(y^2\)?

Finding the Number of Factors of an Integer

First make prime factorization of an integer \(n=a^p*b^q*c^r\), where \(a\), \(b\), and \(c\) are prime factors of \(n\) and \(p\), \(q\), and \(r\) are their powers.

The number of factors of \(n\) will be expressed by the formula \((p+1)(q+1)(r+1)\). NOTE: this will include 1 and n itself.

Example: Finding the number of all factors of 450: \(450=2^1*3^2*5^2\)

Total number of factors of 450 including 1 and 450 itself is \((1+1)*(2+1)*(2+1)=2*3*3=18\) factors.

(1) \(x=4\). From this statement we have that\(x^3=64=2^6\), thus the number of factors of 64 is 6+1=7.

Now, may \(y^2\) have the number of factors which is factor of 7, so 1 or 7 factors? Well may have or may not. Number of factors of a perfect square is odd. So \(y^2\) should have either 1 factor (for example if y^2=1^2) or 7 (for example if y^2=27^2=3^6 or y^2=8^2=2^6), both are possible, BUT \(y^2\) can have other odd number of factors say 3 (for example if y=5^2) and 3 is not factor of 7. Not sufficient

(2) \(y=6\). From that: \(y^2=36=2^2*3^2\), thus the number of factors of 36 is (2+1)*(2+1)=9.

Can \(x^3\) have the number of factors which is multiple of 9 (9, 18, 27, ...)? Let's represent \(x\) as the product of its prime factors: \(x^3=(a^p*b^q*c^r)^3=a^{3p}*b^{3q}*c^{3r}\). The number of factors would be \((3p+1)(3q+1)(3r+1)\) and this should be multiple of 9. BUT \((3p+1)(3q+1)(3r+1)\) is not divisible by 3, hence it can not be multiple of 9. The answer is NO. Sufficient.

Not to complicate \(x^3\) has \(3k+1>\) number of distinct factors (1, 4, 7, 10, ... odd or even number), so the number of factors of \(x^3\) is 1 more than a multiple of 3, thus it's not divisible by 3 and hence not by 9.


Answer: B



Dear Bunuel

Does the formula of total factor have limitation? it does not work for 1? If I apply the rule for 1 it will yield 2 factors which is wrong.

can you clarify please?


1 can be written as a^0*b^0*c^0... --> # of factors = (0+1)(0+1)(0+1)... = 1.

But it's obvious even without it that 1 has 1 factor...
Manager
Manager
Joined: 28 Jun 2018
Posts: 96
Own Kudos [?]: 221 [3]
Given Kudos: 329
Location: Bouvet Island
GMAT 1: 670 Q50 V31
GMAT 2: 640 Q47 V30
GMAT 3: 700 Q49 V36
GMAT 4: 490 Q39 V18
GPA: 4
Send PM
Re: M28-02 [#permalink]
2
Kudos
1
Bookmarks
Useful to know -

a) The number of factors of any perfect square WILL always be ODD.

b) For perfect squares the prime factorization WILL always have even powers.
Example-
\(25 = 5^2 \\
1444 = 3^2 * 2^4\)
So, the powers of all prime factors will be even powers.

c) Similarly, the cubes the prime factorization WILL have powers divisible by 3.
Example -
\(8 = 2^3\)
\(3375 = 3^3 * 5^3\)

Keeping point c in mind, lets look at statement 2.
\(y = 6\)
\(y^2 = 36 = 2^2 * 3^2 = 9\) factors.

Think about \(x^3\) factors now. It will always have a power divisible by 3.
To find the number of factors we always add 1 to prime powers and then multiply them.
If we add one to any multiple of 3 then it wont be divisible by 3.
Basically it is non-multiples of 3 or product of non-multiples of 3 wont be divisible by 3. Hence if not divisible by 3 then it wont be divisible by 9.
Example- 27 is a multiple of 3. Add 1 to it and we get 28. It is not divisible by 3. Co-primes have no common factor.

Hence SUFFICIENT.

Bunuel please correct me if i am wrong.
Intern
Intern
Joined: 14 Mar 2016
Posts: 12
Own Kudos [?]: 6 [1]
Given Kudos: 359
Concentration: Finance, Marketing
GMAT 1: 600 Q45 V28
GPA: 3.65
Send PM
Re: M28-02 [#permalink]
I think this should be an 800 level question!
Manager
Manager
Joined: 08 Oct 2022
Posts: 91
Own Kudos [?]: 45 [1]
Given Kudos: 51
Location: India
GMAT 1: 740 Q48 V44
GMAT 2: 770 Q49 V47 (Online)
GPA: 3.98
Send PM
Re: M28-02 [#permalink]
1
Kudos
This question is so clever. I don't even feel bad about getting this wrong.
Math Expert
Joined: 02 Sep 2009
Posts: 92901
Own Kudos [?]: 618684 [0]
Given Kudos: 81586
Send PM
Re: M28-02 [#permalink]
Expert Reply
I have edited the question and the solution by adding more details to enhance its clarity. I hope it is now easier to understand.
Manager
Manager
Joined: 14 Feb 2014
Posts: 78
Own Kudos [?]: 16 [1]
Given Kudos: 3627
Send PM
Re: M28-02 [#permalink]
1
Kudos
This is the definition of a gold standard&clever Question with a great explanation provided by Bunuel, thank you Bunuel!

I too don't mind that i answered this great question wrong.
GMAT Club Bot
Re: M28-02 [#permalink]
Moderator:
Math Expert
92901 posts

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