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 500,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:

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

The largest positive integer that must divide \(n\), means for the least value of \(n\) which satisfies the given statement in the question. The lowest square of an integer, which is multiple of \(72\) is \(144\) --> \(n^2=144=12^2=72*2\) --> \(n_{min}=12\). Largest factor of \(12\) is \(12\).

OR:

Given: \(72k=n^2\), where \(k\) is an integer \(\geq1\) (as \(n\) is positive).

\(72k=n^2\) --> \(n=6\sqrt{2k}\), as \(n\) is an integer \(\sqrt{2k}\), also must be an integer. The lowest value of \(k\), for which \(\sqrt{2k}\) is an integer is when \(k=2\) --> \(\sqrt{2k}=\sqrt{4}=2\) --> \(n=6\sqrt{2k}=6*2=12\)

169. If n is a positive integer and n2 is divisible by 72, then the largest positive integer that must divide n is (A) 6 (8) 12 (C) 24 (0) 36 (E) 48

If we are looking for largest positive integer that must divide n, why can it not be 48.

because if n2 = 72 * 32 then n will be 48 , so does this not mean n is divisible by 48.

Please explain.

Thanks

The question asks about "the largest positive integer that MUST divide n", not COULD divide n. Since the least value of n for which n^2 is a multiple of 72 is 12 then the largest positive integer that MUST divide n is 12.

Complete solution of this question is given above. Please ask if anything remains unclear.
_________________

Re: If n is a positive integer and n^2 is divisible by 72, then [#permalink]

Show Tags

14 Aug 2012, 22:50

2

This post received KUDOS

2

This post was BOOKMARKED

Normally i divide the number into the primes just to see how many more primes we need to satisfy the condition, so in our case: n^2/72=n*n/2^3*3^2, in order to have minimum in denominator we should try modify the smallest number. If we have one more 2 then the n*n will perfectly be devisible to 2^4*3^2 from here we see that the largest number is 2*2*3=12 Hope i explained my thought.
_________________

If you found my post useful and/or interesting - you are welcome to give kudos!

169. If n is a positive integer and n2 is divisible by 72, then the largest positive integer that must divide n is (A) 6 (8) 12 (C) 24 (0) 36 (E) 48

If we are looking for largest positive integer that must divide n, why can it not be 48.

because if n2 = 72 * 32 then n will be 48 , so does this not mean n is divisible by 48.

Please explain.

Thanks

The question asks about "the largest positive integer that MUST divide n", not COULD divide n. Since the least value of n for which n^2 is a multiple of 72 is 12 then the largest positive integer that MUST divide n is 12.

Complete solution of this question is given above. Please ask if anything remains unclear.

I spent a few hours on this one alone and I'm still not clear. I chose 12 at first, but then changed to 48.

I'm not a native speaker, so here is how I interpreted this question: "the largest positive integer that must divide n" = "the largest positive factor of n". Since n is a variable (i.e. n is moving), so is its largest factor. Please correct if I'm wrong here.

I know that if n = 12, n^2 = 144 = 2 * 72 (satisfy the condition). When n = 12, the largest factor of n is n itself, which is 12. Check: 12 is the largest positive number that must divide 12 --> true

However if n = 48, n^2 = 48 * 48 = 32 * 72 (satisfy the condition too). When n = 48, the largest factor of n is n itself, which is 48. Check: 48 is the largest positive number that must divide 48 --> true

So, I also notice that the keyword is "MUST", not "COULD". The question is, why is 48 not "MUST divide 48", but instead only "COULD divide 48"? I'm not clear right here. Why is 12 "MUST divide 12"? What's the difference between them?

169. If n is a positive integer and n2 is divisible by 72, then the largest positive integer that must divide n is (A) 6 (8) 12 (C) 24 (0) 36 (E) 48

If we are looking for largest positive integer that must divide n, why can it not be 48.

because if n2 = 72 * 32 then n will be 48 , so does this not mean n is divisible by 48.

Please explain.

Thanks

The question asks about "the largest positive integer that MUST divide n", not COULD divide n. Since the least value of n for which n^2 is a multiple of 72 is 12 then the largest positive integer that MUST divide n is 12.

Complete solution of this question is given above. Please ask if anything remains unclear.

I spent a few hours on this one alone and I'm still not clear. I chose 12 at first, but then changed to 48.

I'm not a native speaker, so here is how I interpreted this question: "the largest positive integer that must divide n" = "the largest positive factor of n". Since n is a variable (i.e. n is moving), so is its largest factor. Please correct if I'm wrong here.

I know that if n = 12, n^2 = 144 = 2 * 72 (satisfy the condition). When n = 12, the largest factor of n is n itself, which is 12. Check: 12 is the largest positive number that must divide 12 --> true

However if n = 48, n^2 = 48 * 48 = 32 * 72 (satisfy the condition too). When n = 48, the largest factor of n is n itself, which is 48. Check: 48 is the largest positive number that must divide 48 --> true

So, I also notice that the keyword is "MUST", not "COULD". The question is, why is 48 not "MUST divide 48", but instead only "COULD divide 48"? I'm not clear right here. Why is 12 "MUST divide 12"? What's the difference between them?

Thanks,

Caten

Only restriction we have on positive integer n is that n^2 is divisible by 72. The least value of n for which n^2 is divisible by 72 is 12, thus n must be divisible by 12 (n is in any case divisible by 12). For all other values of n, for which n^2 is divisible by 72, n will still be divisible by 12. This means that n is always divisible by 12 if n^2 is divisible by 72.

Now, ask yourself: if n=12, is n divisible by 48? No. So, n is not always divisible by 48.

Re: If n is a positive integer and n^2 is divisible by 72, then [#permalink]

Show Tags

02 Nov 2012, 05:20

2

This post received KUDOS

I approach this problem by prime factorisation. any square must have 2 pairs of prime factors. prime factorisation of 72 has 2*2, 3*3 and 2. n^2 must have one more 2 as a prime factor. Hence lasrgest number which must devide n is 2*3*2 = 12
_________________

Only restriction we have on positive integer n is that n^2 is divisible by 72. The least value of n for which n^2 is divisible by 72 is 12, thus n must be divisible by 12 (n is in any case divisible by 12). For all other values of n, for which n^2 is divisible by 72, n will still be divisible by 12. This means that n is always divisible by 12 if n^2 is divisible by 72.

Now, ask yourself: if n=12, is n divisible by 48? No. So, n is not always divisible by 48.

Hope it's clear.

Thank you very much Bunuel. Very clear now. Now I understand what "must" means. It means it will be always true regardless of n. As you said (and I chose), when n = 24 or 36 or 48, the answer 48 can divide 48, but cannot divide 12. So the "must" here is not maintained. In this case we have to choose the largest factor of the least possible value of n to ensure that largest factor is also a factor of other values of n. Therefore the least value of n is 12, the largest factor of 12 is also 12. This factor also divides other n values, for all n such that n^2 = 72k.

My mistake was that I didn't understand the "must" wording and didn't check whether my answer 48 can divide ALL possible values of n, including n=12. This is what "must" mean.

Only restriction we have on positive integer n is that n^2 is divisible by 72. The least value of n for which n^2 is divisible by 72 is 12, thus n must be divisible by 12 (n is in any case divisible by 12). For all other values of n, for which n^2 is divisible by 72, n will still be divisible by 12. This means that n is always divisible by 12 if n^2 is divisible by 72.

Now, ask yourself: if n=12, is n divisible by 48? No. So, n is not always divisible by 48.

Hope it's clear.

Thank you very much Bunuel. Very clear now. Now I understand what "must" means. It means it will be always true regardless of n. As you said (and I chose), when n = 24 or 36 or 48, the answer 48 can divide 48, but cannot divide 24 and 36. So the "must" here is not maintained. In this case we have to choose the largest factor of the least possible value of n to ensure that largest factor also a factor of other values of n. Therefore the least value of n is 12, the largest factor of 12 is also 12. This factor also divides other n values, for all n such that n^2 = 72k.

My mistake was that I didn't understand the "must" wording and didn't check whether my answer 48 can divide ALL possible values of n, including n=12. This is what "must" mean.

\(n^2\) divisible by 72 is 144 ==> (\(2^3 * 3^2\)). So n is 12

largest positive integer divides 12 must be 12 itself

pls correct me if im wrong

Correction: Prime factorization for 72 is \(2^3 * 3^2\) -- there are 3 twos. Also your solution needs further reasoning. 12 is not the only number n can take.
_________________

\(n^2\) divisible by 72 is 144 ==> (\(2^3 * 3^2\)). So n is 12

largest positive integer divides 12 must be 12 itself

pls correct me if im wrong

Correction: Prime factorization for 72 is \(2^3 * 3^2\) -- there are 3 twos. Also your solution needs further reasoning. 12 is not the only number n can take.

ya it was a typo.. I corrected it... Why 12 cannot be solution here?

Ya only 12 is not number greater than and divisible by 72, but it is first number ! So i choose it
_________________

GMAT - Practice, Patience, Persistence Kudos if u like

Re: If n is a positive integer and n^2 is divisible by 72, then [#permalink]

Show Tags

12 Jan 2013, 06:35

The language used in this problem is one of the things that might get you under timed conditions; "the greatest... that must" is the LEAST, just like Bunuel explained and it is very important to have this sort of Gmat wording clear in mind.

Other than that it's not too difficult.
_________________

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

Please let me know why 48 can't be the answer?

Firstly , is there any specific reason for contesting 48 as an answer?

Nonetheless, if\(n^2\) is divisible by 72, then n must have a prime factorization of the kind : \(2^2*3*.....(more primes)\). Now the power of 2 has to be atleast 2, because 72 contains \(2^3\). Thus, n = 12*some primes. Thus, 12 is the largest positive integer which WILL/MUST divide n.

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

Please let me know why 48 can't be the answer?

Firstly , is there any specific reason for contesting 48 as an answer?

Nonetheless, if\(n^2\) is divisible by 72, then n must have a prime factorization of the kind : \(2^2*3*.....(more primes)\). Now the power of 2 has to be atleast 2, because 72 contains \(2^3\). Thus, n = 12*some primes. Thus, 12 is the largest positive integer which WILL/MUST divide n.

Hope this helps.

Thanks mate for the reply.. But If we choose the value of n as 48 then n^2 (48 * 48) will also be divisible by 72. As the same thing is happening in case of n=12, as you have explained. Since we have to choose the largest value of n, why cant 48 be the right value of n?

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

Please let me know why 48 can't be the answer?

Firstly , is there any specific reason for contesting 48 as an answer?

Nonetheless, if\(n^2\) is divisible by 72, then n must have a prime factorization of the kind : \(2^2*3*.....(more primes)\). Now the power of 2 has to be atleast 2, because 72 contains \(2^3\). Thus, n = 12*some primes. Thus, 12 is the largest positive integer which WILL/MUST divide n.

Hope this helps.

Thanks mate for the reply.. But If we choose the value of n as 48 then n^2 (48 * 48) will also be divisible by 72. As the same thing is happening in case of n=12, as you have explained. Since we have to choose the largest value of n, why cant 48 be the right value of n?

Thanks a lot Bunuel. Now I got it. My understanding is:

possible values of n = 12, 24, 36 and 48. But it is 12 that can divide all the possible values of n. If we consider 48, it will not divide 12, 24 and 36. Hence, 12 is the value that MUST divide n.

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

Please let me know why 48 can't be the answer?

Firstly , is there any specific reason for contesting 48 as an answer?

Nonetheless, if\(n^2\) is divisible by 72, then n must have a prime factorization of the kind : \(2^2*3*.....(more primes)\). Now the power of 2 has to be atleast 2, because 72 contains \(2^3\). Thus, n = 12*some primes. Thus, 12 is the largest positive integer which WILL/MUST divide n.

Hope this helps.

Thanks mate for the reply.. But If we choose the value of n as 48 then n^2 (48 * 48) will also be divisible by 72. As the same thing is happening in case of n=12, as you have explained. Since we have to choose the largest value of n, why cant 48 be the right value of n?

12 must divide n , 24,36,48 may divide n . n^2 / 72, here n can be 12, 36,48....... but to be divided by 72, n should be at least 12. (12^2 = 144) so 12 is must and the rest are may or could............ below 12 not possible. At least 12..........
_________________

There’s something in Pacific North West that you cannot find anywhere else. The atmosphere and scenic nature are next to none, with mountains on one side and ocean on...

This month I got selected by Stanford GSB to be included in “Best & Brightest, Class of 2017” by Poets & Quants. Besides feeling honored for being part of...

Joe Navarro is an ex FBI agent who was a founding member of the FBI’s Behavioural Analysis Program. He was a body language expert who he used his ability to successfully...