How to solve this Q?

This topic has expert replies
Source: — Problem Solving |

User avatar
GMAT Instructor
Posts: 15539
Joined: Tue May 25, 2010 12:04 pm
Location: New York, NY
Thanked: 13060 times
Followed by:1906 members
GMAT Score:790

by GMATGuruNY » Mon Apr 08, 2013 5:04 pm
sanaa.rizwan wrote:if n is a positive integer and n^2 is divisible by 72, then the largest positive integer that must divide n is
a.6
b.12
c.24
d.36
e.48
n² must be divisible by 72.
Since n² is the square of an integer, the value of n² must be a perfect square: 1, 4, 9, 16, 25, 36, 64, 81, 100, 121, 144...
In the list above, the smallest value divisible by 72 is 144.
If n² = 144, then n = 12.
This is the MINIMUM value of n.
Since n=12 is not divisible by 24, 36, or 48, eliminate C, D and E.
Since n cannot be any smaller than 12, it must be divisible by answer choice B (12).

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

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 511
Joined: Wed Aug 11, 2010 9:47 am
Location: Delhi, India
Thanked: 344 times
Followed by:86 members

by Anju@Gurome » Mon Apr 08, 2013 11:00 pm
sanaa.rizwan wrote:if n is a positive integer and n^2 is divisible by 72, then the largest positive integer that must divide n is
Let us assume, n² = 72k = (2³)*(3²)*k, where k is some positive integer.
We can see that, minimum possible value of k such that (2³)*(3²)*k becomes a square of an integer is 2.
Hence, minimum possible value of n² is (2�)*(3²).
So, minimum possible value of n is (2²)*3 = 12.

The correct answer is B.
Last edited by Anju@Gurome on Mon Apr 22, 2013 9:24 pm, edited 1 time in total.
Anju Agarwal
Quant Expert, Gurome

Backup Methods : General guide on plugging, estimation etc.
Wavy Curve Method : Solving complex inequalities in a matter of seconds.

§ GMAT with Gurome § Admissions with Gurome § Career Advising with Gurome §

Master | Next Rank: 500 Posts
Posts: 468
Joined: Mon Jul 25, 2011 10:20 pm
Thanked: 29 times
Followed by:4 members

by vipulgoyal » Mon Apr 08, 2013 11:09 pm
n^2 / 72
n x n / 2x2x2x3x3,so each n must have
2x2x3 = 12 (minimum value on n)
so ans 12

User avatar
Master | Next Rank: 500 Posts
Posts: 308
Joined: Thu Mar 29, 2012 12:51 am
Thanked: 16 times
Followed by:3 members

by Lifetron » Tue Apr 09, 2013 1:45 am
sanaa.rizwan wrote:if n is a positive integer and n^2 is divisible by 72, then the largest positive integer that must divide n is
a.6
b.12
c.24
d.36
e.48
From the question, How do we know that we have to find the MINIMUM value of n ?

Thank you !

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 511
Joined: Wed Aug 11, 2010 9:47 am
Location: Delhi, India
Thanked: 344 times
Followed by:86 members

by Anju@Gurome » Tue Apr 09, 2013 1:51 am
gughanbose wrote:From the question, How do we know that we have to find the MINIMUM value of n ?
Because we can always make n sufficiently large such that all the options (even numbers larger than the provided options) will divide n.

For example, if n = 72*48, then all the given options divided n.

But, there will be some values of n, for which 24 or 36 or 48 will not divide n.
Hence, the idea is to make n as small as possible. The factors of the smallest n will always divide other larger values of n.

Hope that helps.
Anju Agarwal
Quant Expert, Gurome

Backup Methods : General guide on plugging, estimation etc.
Wavy Curve Method : Solving complex inequalities in a matter of seconds.

§ GMAT with Gurome § Admissions with Gurome § Career Advising with Gurome §