If m is a positive integer and m^2 is divisible by 48, then the largest positive integer that must divide m is?
(A) 3
(B) 6
(C) 8
(D) 12
(E) 16
OA:D
Source:GMATPrep QP1
If m is a positive integer and m^2 is d
This topic has expert replies
GMAT/MBA Expert
- Brent@GMATPrepNow
- GMAT Instructor
- Posts: 16207
- Joined: Mon Dec 08, 2008 6:26 pm
- Location: Vancouver, BC
- Thanked: 5254 times
- Followed by:1268 members
- GMAT Score:770
ASIDE-----------------------------------NandishSS wrote:If m is a positive integer and m² is divisible by 48, then the largest positive integer that must divide m is?
(A) 3
(B) 6
(C) 8
(D) 12
(E) 16
A lot of integer property questions can be solved using prime factorization.
For questions involving divisibility, divisors, factors and multiples, we can say:
If N is divisible by k, then k is "hiding" within the prime factorization of N
Consider these examples:
24 is divisible by 3 because 24 = (2)(2)(2)(3)
Likewise, 70 is divisible by 5 because 70 = (2)(5)(7)
And 112 is divisible by 8 because 112 = (2)(2)(2)(2)(7)
And 630 is divisible by 15 because 630 = (2)(3)(3)(5)(7)
--------------------------------------
m² is divisible by 48
48 = (2)(2)(2)(2)(3)
This tells us that m² = (2)(2)(2)(2)(3)(?)(?)(?)(?)(?)
NOTE: the various (?)'s includes other possible prime numbers in the prime factorization of m²
So, we know how the prime factorization of m² looks.
What does this tell us about the prime factorization of m?
First, since there are FOUR 2's in the prime factorization of m², we know that the prime factorization of m will include at least TWO 2's, since (2)(2) x (2)(2) = (2)(2)(2)(2)
Likewise, since there is ONE 3 in the prime factorization of m², we know that the prime factorization of m will include at least ONE 3.
So, we can be certain that m = (2)(2)(3)(?)(?)(?)(?)(?)
Since (2)(2)(3) = 12, we can be certain that 12 is a divisor of m.
Answer: D
GMAT/MBA Expert
- Brent@GMATPrepNow
- GMAT Instructor
- Posts: 16207
- Joined: Mon Dec 08, 2008 6:26 pm
- Location: Vancouver, BC
- Thanked: 5254 times
- Followed by:1268 members
- GMAT Score:770
ANOTHER APPROACH:NandishSS wrote:If m is a positive integer and m² is divisible by 48, then the largest positive integer that must divide m is?
(A) 3
(B) 6
(C) 8
(D) 12
(E) 16
m² is divisible by 48
48 = (2)(2)(2)(2)(3)
Notice that 48 is NOT the square of an integer.
So, we know that m² does NOT equal 48
So, what COULD be the value of m²?
From my post above, we know that m² = (2)(2)(2)(2)(3)(?)(?)(?)(?)(?)
Also, from the above post, we know that, since there is ONE 3 in the prime factorization of m², we know that the prime factorization of m will include at least ONE 3. This also tells us that the prime factorization of m² must consist of TWO 3's.
When we add a second 3 to that prime factorization, we get, m² = (2)(2)(2)(2)(3)(3) = 144, and 144 IS the square of an integer.
So, the SMALLEST possible value of m² is 144
This means the SMALLEST possible value of m is 12
So, the biggest integer that MUST divide m is 12
Answer: D
Cheers,
Brent
GMAT/MBA Expert
- Jeff@TargetTestPrep
- GMAT Instructor
- Posts: 1462
- Joined: Thu Apr 09, 2015 9:34 am
- Location: New York, NY
- Thanked: 39 times
- Followed by:22 members
We are given that m^2/48 = integer or (m^2)/(2^4)(3^1) = integer.NandishSS wrote:If m is a positive integer and m^2 is divisible by 48, then the largest positive integer that must divide m is?
(A) 3
(B) 6
(C) 8
(D) 12
(E) 16
However, since m^2 is a perfect square, we need to make 48 or (2^4)(3^1) a perfect square. Since all perfect squares consist of unique prime, each raised to an even exponent, the smallest perfect square that divides into m^2 is (2^4)(3^2) = 144.
Thus, m^2/144 = integer
Since m^2 is divisible by 144, we see that the largest value that divides m is 12.
Answer: D
Jeffrey Miller
Head of GMAT Instruction
[email protected]
See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews
GMAT/MBA Expert
- [email protected]
- Elite Legendary Member
- Posts: 10392
- Joined: Sun Jun 23, 2013 6:38 pm
- Location: Palo Alto, CA
- Thanked: 2867 times
- Followed by:511 members
- GMAT Score:800
Hi NandishSS,
This question has a number of logic 'shortcuts' built into it, so if you were low on time you could logically guess the correct answer. Here's how you could do it... To start, you have to note that the answer choices are numbers and one of them IS the LARGEST positive integer that will divide into M.
Since M is an integer and M^2 is divisible by 48, you should be able to logically deduce that M will be divisible by both 2 (since 48 is even) and 3 (you can use the 'rule of 3' to quickly determine that fact). So we need a number that is divisible by BOTH 2 and 3. With that information alone, we can eliminate Answer choices A, C and E. The prompt asks for the LARGEST positive integer, so between the two remaining answers, and since 48 has so many 2s in it - and that the remaining answers are 6 and 12 - it's highly likely that the correct answer is 12 (which you can prove using the other approaches offered here).
Final Answer: D
GMAT assassins aren't born, they're made,
Rich
This question has a number of logic 'shortcuts' built into it, so if you were low on time you could logically guess the correct answer. Here's how you could do it... To start, you have to note that the answer choices are numbers and one of them IS the LARGEST positive integer that will divide into M.
Since M is an integer and M^2 is divisible by 48, you should be able to logically deduce that M will be divisible by both 2 (since 48 is even) and 3 (you can use the 'rule of 3' to quickly determine that fact). So we need a number that is divisible by BOTH 2 and 3. With that information alone, we can eliminate Answer choices A, C and E. The prompt asks for the LARGEST positive integer, so between the two remaining answers, and since 48 has so many 2s in it - and that the remaining answers are 6 and 12 - it's highly likely that the correct answer is 12 (which you can prove using the other approaches offered here).
Final Answer: D
GMAT assassins aren't born, they're made,
Rich
- shashank.ism
- Legendary Member
- Posts: 1022
- Joined: Mon Jul 20, 2009 11:49 pm
- Location: Gandhinagar
- Thanked: 41 times
- Followed by:2 members
Since m^2 is divisible by 48
& 48 = 2x2x2x2x3.
Here we will take value which is in pair as single unit and value which is not in pair as single unit, as value which is not in pair must be in pair in the actual value of m^2
So largest positiive integer that must divide m is 2 x 2 x 3 = 12. Hence D.
& 48 = 2x2x2x2x3.
Here we will take value which is in pair as single unit and value which is not in pair as single unit, as value which is not in pair must be in pair in the actual value of m^2
So largest positiive integer that must divide m is 2 x 2 x 3 = 12. Hence D.
NandishSS wrote:If m is a positive integer and m^2 is divisible by 48, then the largest positive integer that must divide m is?
(A) 3
(B) 6
(C) 8
(D) 12
(E) 16
OA:D
Source:GMATPrep QP1
My Websites:
www.mba.webmaggu.com - India's social Network for MBA Aspirants
www.deal.webmaggu.com -India's online discount, coupon, free stuff informer.
www.dictionary.webmaggu.com - A compact free online dictionary with images.
Nothing is Impossible, even Impossible says I'm possible.
www.mba.webmaggu.com - India's social Network for MBA Aspirants
www.deal.webmaggu.com -India's online discount, coupon, free stuff informer.
www.dictionary.webmaggu.com - A compact free online dictionary with images.
Nothing is Impossible, even Impossible says I'm possible.
GMAT/MBA Expert
- Jay@ManhattanReview
- GMAT Instructor
- Posts: 3008
- Joined: Mon Aug 22, 2016 6:19 am
- Location: Grand Central / New York
- Thanked: 470 times
- Followed by:34 members
I see many great solutions to this question.NandishSS wrote:If m is a positive integer and m^2 is divisible by 48, then the largest positive integer that must divide m is?
(A) 3
(B) 6
(C) 8
(D) 12
(E) 16
OA:D
Source:GMATPrep QP1
Here is mine. I think this one is a shorter one.
We know that m^2 is divisible by 48, thus m^2 = 48K; where K is a positive number.
m^2 = 48K => m = √(48K) = √(2x2x2x2x3xK)
=> m = 4.√(3K)
Since m is an integer, √(3K) must also be an integer. The minimum value of K would be 3.
=> m = 4.√(3K) = 4.√(3x3) = 4x3 = 12
Thus, the largest positive integer that must divide m is 12.
The correct answer: D
Hope this helps!
Relevant book: Manhattan Review GMAT Data Sufficiency Guide
-Jay
_________________
Manhattan Review GMAT Prep
Locations: New York | Bangalore | Guangzhou | Buenos Aires | and many more...
Schedule your free consultation with an experienced GMAT Prep Advisor! Click here.
-
- GMAT Instructor
- Posts: 2630
- Joined: Wed Sep 12, 2012 3:32 pm
- Location: East Bay all the way
- Thanked: 625 times
- Followed by:119 members
- GMAT Score:780
Let's say that
m² = 48 * (some integer)
Since the left side is a square, the right side must be as well.
48 = 16 * 3 = a square * 3
For this to be a square, we need another 3. From here, we can say that
m² = 48 * 3 * (whatever)
and since 48 * 3 = 12 * 12, the square we were after, we can write this as
m² = 12 * 12 * (whatever)
So m must be divisible by 12.
m² = 48 * (some integer)
Since the left side is a square, the right side must be as well.
48 = 16 * 3 = a square * 3
For this to be a square, we need another 3. From here, we can say that
m² = 48 * 3 * (whatever)
and since 48 * 3 = 12 * 12, the square we were after, we can write this as
m² = 12 * 12 * (whatever)
So m must be divisible by 12.
-
- GMAT Instructor
- Posts: 2630
- Joined: Wed Sep 12, 2012 3:32 pm
- Location: East Bay all the way
- Thanked: 625 times
- Followed by:119 members
- GMAT Score:780
Another approach is trying the answers.
A: If m = 3, then m² = 3 * 3. Not divisible by 48.
B: If m = 6, then m² = 6 * 6. Not divisible by 48.
C: If m = 8, then m² = 8 * 8. Not divisible by 48.
D: If m = 12, then m² = 12 * 12. Success!
E: If m = 16, then m² = 16 * 16. Not divisible by 48.
So 12 seems like a reasonable answer. Solving this way doesn't quite reveal the logic behind the problem, of course, but it can help you a reasonable confident answer in a pinch on test day.
A: If m = 3, then m² = 3 * 3. Not divisible by 48.
B: If m = 6, then m² = 6 * 6. Not divisible by 48.
C: If m = 8, then m² = 8 * 8. Not divisible by 48.
D: If m = 12, then m² = 12 * 12. Success!
E: If m = 16, then m² = 16 * 16. Not divisible by 48.
So 12 seems like a reasonable answer. Solving this way doesn't quite reveal the logic behind the problem, of course, but it can help you a reasonable confident answer in a pinch on test day.