BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Divisibility Quant Review (#169)

Expert replies
Source: — Problem Solving |

by Anurag@Gurome » Tue Mar 05, 2013 7:37 pm
DCS80 wrote:If n is a positive integer and n2 is divisible by 72, then the largest positive integer that must divide n is:

a)6
b)12
c)24
d)36
e)48


answer later
Picking Number Approach:
Least possible value of n² such that n² is divisible by 72 is 72*2 = 144
Hence, minimum possible value of n = 12.
Largest possible integer that divides n is 12.


Algebraic Approach:
n² is divisible by 72
Hence we can write n² as 72k, where k is an positive integer.
Now, n = √n² = √(72k) = √[(2)*(36)*k] = 6√(2k)
Now for n to be an integer, k must be an even multiple of a perfect square.
Hence, we can write k = 2m², where is a positive integer.
Now, n = 6√(2k) = 6√(2*2*m²) = 12m

Hence, largest possible integer that divides n is 12


The correct answer is B.
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/
Join the discussion

by GMATGuruNY » Tue Mar 05, 2013 9:19 pm
DCS80 wrote:If n is a positive integer and n2 is divisible by 72, then the largest positive integer that must divide n is:

a)6
b)12
c)24
d)36
e)48
Since n² is the square of an integer, n² is a perfect square.
Since n² is divisible by 72, n² must be a perfect square greater than 72, implying the following options:
n² = 9*9 = 81. Not a multiple of 72.
n² = 10*10 = 100. Not a multiple of 72.
n² = 11*11 = 121. Not a multiple of 72.
n² = 12*12 = 144, which is a multiple of 72.

Thus, n=12 is the SMALLEST POSSIBLE VALUE of n.
Of the five answer choices, the greatest option that MUST divide into n=12 is B.

The correct answer is B.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Join the discussion

by DCS80 » Wed Mar 06, 2013 8:04 am
awesome as usual!
Join the discussion

by vipulgoyal » Wed Mar 06, 2013 8:35 pm
another way
n*n/72 gives positive int
n*n/2x2x2x3x3
so the each n must have 2x2x3 in order to give int
hence 12 is the greatest multiple of n
Join the discussion

by Scott@TargetTestPrep » Tue Dec 12, 2017 7:17 am
DCS80 wrote:If n is a positive integer and n2 is divisible by 72, then the largest positive integer that must divide n is:

a)6
b)12
c)24
d)36
e)48
We are given that n^2/72 = integer or (n^2)/(2^3)(3^2) = integer.

However, since n^2 is a perfect square, we need to make 72 or (2^3)(3^2) a perfect square. Since all perfect squares consist of unique primes, each raised to an even exponent, the smallest perfect square that divides into n^2 is (2^4)(3^2) = 144.

Since n^2/144 = integer, then n/12 = integer, and thus the largest positive integer that must divide n is 12.

Answer: B

Scott Woodbury-Stewart
Founder and CEO
[email protected]

Image

See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews

ImageImage
Join the discussion

by Brent@GMATPrepNow » Tue Dec 12, 2017 8:23 am
DCS80 wrote:If n is a positive integer and n2 is divisible by 72, then the largest positive integer that must divide n is:

a)6
b)12
c)24
d)36
e)48


answer later
---------------ASIDE #1--------------------------------------
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 a factor by k, then k is "hiding" within the prime factorization of N

Consider these examples:
3 is a factor of 24, because 24 = (2)(2)(2)(3), and we can clearly see the 3 hiding in the prime factorization.
Likewise, 5 is a factor of 70 because 70 = (2)(5)(7)
And 8 is a factor of 112 because 112 = (2)(2)(2)(2)(7)
And 15 is a factor of 630 because 630 = (2)(3)(3)(5)(7)

---------------ASIDE #2--------------------------------------
IMPORTANT CONCEPT: The prime factorization of a perfect square will have an even number of each prime

For example: 400 is a perfect square.
400 = 2x2x2x2x5x5. Here, we have four 2's and two 5's
This should make sense, because the even number of primes allows us to split the primes into two EQUAL groups to demonstrate that the number is a square.
For example: 400 = 2x2x2x2x5x5 = (2x2x5)(2x2x5) = (2x2x5)²

Likewise, 576 is a perfect square.
576 = 2x2x2x2x2x2x3x3 = (2x2x2x3)(2x2x2x3) = (2x2x2x3)²
--------NOW ONTO THE QUESTION!------------------

Given: n² is divisible by 72 (in other words, there's a 72 hiding in the prime factorization of n²)
So, n² = (2)(2)(2)(3)(3)(?)(?)(?)(?)(?)... [the ?'s represent other possible primes in the prime factorization of n²]
Since we have an ODD number of 2's in the prime factorization, we can be certain that there is at least one more 2 in the prime factorization.
So, we know that n² = (2)(2)(2)(3)(3)(2)(?)(?)(?)(?)
So, while there MIGHT be tons of other values in the above prime factorization, we do know that there MUST BE at least four 2's and two 3's.
Now do some grouping to get: n² = [(2)(2)(3)(?)(?)...][(2)(2)(3)(?)(?)...]
From this we can see that n = (2)(2)(3)(?)(?)...

Question: What is the largest positive integer that must divide n?
(2)(2)(3) = 12.
So, the largest positive integer that must divide n is 12

Answer: B

Cheers,
Brent
Brent Hanneson - Creator of GMATPrepNow.com
Image
Join the discussion