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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 350,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

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:

The largest possible integer that divides a given integer is the integer itself.
Now out of the given values of n we need to larget value of n such n^2 is divisible by n. The condition holds true for B,C,D,E and largest among them is E. So my pick is E.

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 = +VE SQRT OF N^2

N^2= 72K = 2^3*3^2*K AND SINCE N IS INTIGER THEN

N^2 MUST AT LEAST = 144B WHERE B IS +VE PERFECT SQURE INTIGER

THUS N IS AT LEAST= 12G

THE KEY IS ( MUST DEVIDE) , WE ONLY KNOW FROM ABOVE THAT 12 IS

BECAUSE G COULD BE ANYTHING.

Hope this helps

OA is B, but I am still having a hard time understanding

I think I misunderstood the question . . . so basically, what you're trying to do is find the smallest multiple of 72 that is a perfect square. That way you figure out the largest divisor that (MUST) always divides into n.

Like Yogethsheth, I was thinking largest possible.

I worked this problem using an example, 144 is the least perfect square divisible by 72, and 12 is the square root of 144. So, 12 is the largest integer that can perfectly divide 12.

I worked this problem using an example, 144 is the least perfect square divisible by 72, and 12 is the square root of 144. So, 12 is the largest integer that can perfectly divide 12.

Therefore, my answer is B.[/code]

exactly the logic i used..

if n2 is divisible by 72 then N^2 is divisible by multiples of 72.

The smallest possible perfect sqr is 144 which is divisible by 72

Great to know you are joining Kellogg. A lot was being talked about your last minute interview on Pagalguy (all good though). It was kinda surprise that you got the...

This is a long overdue post! A lot of Indian applicants, having scheduled interviews in March, reached out to me asking about my interview experience with Kellogg. I had a...

A critical phase of the MBA application, concurrent to researching your target schools, is “researching yourself” and building your profile. What are your unique traits? Where do you want to be...