Last visit was: 24 Apr 2024, 17:57 It is currently 24 Apr 2024, 17:57

Close
GMAT Club Daily Prep
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.
Close
Request Expert Reply
Confirm Cancel
SORT BY:
Date
Tags:
Difficulty: 605-655 Levelx   Divisibility/Multiples/Factorsx   Must or Could be True Questionsx   Number Propertiesx                                          
Show Tags
Hide Tags
Target Test Prep Representative
Joined: 14 Oct 2015
Status:Founder & CEO
Affiliations: Target Test Prep
Posts: 18756
Own Kudos [?]: 22049 [15]
Given Kudos: 283
Location: United States (CA)
Send PM
Senior Manager
Senior Manager
Joined: 08 Dec 2015
Posts: 258
Own Kudos [?]: 117 [0]
Given Kudos: 36
GMAT 1: 600 Q44 V27
Send PM
Target Test Prep Representative
Joined: 14 Oct 2015
Status:Founder & CEO
Affiliations: Target Test Prep
Posts: 18756
Own Kudos [?]: 22049 [5]
Given Kudos: 283
Location: United States (CA)
Send PM
Intern
Intern
Joined: 06 Oct 2017
Posts: 6
Own Kudos [?]: 5 [0]
Given Kudos: 225
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
ScottTargetTestPrep wrote:
amitvmane 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


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


Hey Scott,

I think we may have covered it buy why can't we make n=72 therefore n^2 = (72)(72) ... why are we trying to use the SMALLEST perfect square .. using n=72 follows the rules set out in the question... ???
Math Expert
Joined: 02 Sep 2009
Posts: 92900
Own Kudos [?]: 618816 [0]
Given Kudos: 81588
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
Expert Reply
YYZ wrote:
ScottTargetTestPrep wrote:
amitvmane 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


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


Hey Scott,

I think we may have covered it buy why can't we make n=72 therefore n^2 = (72)(72) ... why are we trying to use the SMALLEST perfect square .. using n=72 follows the rules set out in the question... ???


The question asks to find the largest positive integer that MUST divide n. So, which ALWAYS divides n, if n^2 is divisible by 72. Now, while n COULD be divisible by any integer, for example, by by 48, 72, 1,000,000, ... it MUST be divisible only by factors of 12. Why? Because the least value of n for which n^2 is divisible by 144 is 12.

Hope it's clear.
Manager
Manager
Joined: 04 Dec 2015
Posts: 186
Own Kudos [?]: 64 [0]
Given Kudos: 407
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
ScottTargetTestPrep Bunuel i have understood why and how 12 is the answer, but why are we assuming that in order to find largest integer that must divide n, we first need to find the least/minimum possible value of n and not the maximum possible value of n ???

if i take maximum possible value of n ie 48, then 48 will be the largest positive integer that will divide n as per the same logic..

PLEASE HELP me understand this !

Look forward to hearing from you


ScottTargetTestPrep
Target Test Prep Representative
Joined: 14 Oct 2015
Status:Founder & CEO
Affiliations: Target Test Prep
Posts: 18756
Own Kudos [?]: 22049 [0]
Given Kudos: 283
Location: United States (CA)
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
Expert Reply
aditliverpoolfc wrote:
ScottTargetTestPrep Bunuel i have understood why and how 12 is the answer, but why are we assuming that in order to find largest integer that must divide n, we first need to find the least/minimum possible value of n and not the maximum possible value of n ???

if i take maximum possible value of n ie 48, then 48 will be the largest positive integer that will divide n as per the same logic..

PLEASE HELP me understand this !

Look forward to hearing from you


ScottTargetTestPrep


First of all, there is no maximum possible value of n since n can be as large as possible. For example, if a value of n is 24, you can multiply it by any positive integer greater than 1 to make it even larger. Secondly, we are finding the largest number that must divide n,; let’s say that number is d. That is, no matter what the value of n is, d must divide into n. Therefore, we need to find the smallest value of n such that d will divide into it.
GMAT Club Legend
GMAT Club Legend
Joined: 03 Oct 2013
Affiliations: CrackVerbal
Posts: 4946
Own Kudos [?]: 7626 [0]
Given Kudos: 215
Location: India
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
Top Contributor
Solution:

72k=n^2, where k is an integer ≥1 (as n is positive).

72k=n^2

=> n=6√2k

n is an integer

=> √2k, also must be an integer

The minimum value of k, for which √2 k is an integer is at k=2

At k=2,

√2k

=√4=2

n=6√(2k)

=>n=6∗2

=12 (option b)

Devmitra Sen
GMAT SME

Intern
Intern
Joined: 03 May 2021
Posts: 39
Own Kudos [?]: 8 [0]
Given Kudos: 13
Location: Kuwait
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
BrentGMATPrepNow wrote:
amitvmane 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

---------------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

Cheers,
Brent


I'm confused - why can't you throw an additional "2" to each so that n = 24 or any of the other answer choices. The question asks for the LARGEST positive integer after all.
Tutor
Joined: 14 Jun 2019
Status:MBA, Columbia Business School
Posts: 30
Own Kudos [?]: 18 [0]
Given Kudos: 16
Send PM
If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
Expert Reply
GK002 wrote:
I'm confused - why can't you throw an additional "2" to each so that n = 24 or any of the other answer choices. The question asks for the LARGEST positive integer after all.


That is a good question and something I feel should be addressed as part of the solution
Quote:
"Why are we taking the smallest number and calling it largest".


I have tried to explain in the video (forward to 1:36 & 3:27) however if there are still questions, please comment. In the video:

01:36 Understanding what "largest" & "must divide" mean
03:27 Why smallest in the series is the "largest that must divide"
04:50 Step-by-Step strategy to solve this problem

Intern
Intern
Joined: 13 Feb 2020
Posts: 46
Own Kudos [?]: 11 [0]
Given Kudos: 8
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
Bunuel wrote:
SOLUTION

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\)

Answer: B.

Similar questions to practice:

https://gmatclub.com/forum/if-n-is-a-pos ... 27364.html
https://gmatclub.com/forum/if-n-is-a-pos ... 90523.html
https://gmatclub.com/forum/n-is-a-positi ... 04272.html
https://gmatclub.com/forum/if-n-and-y-ar ... 92562.html
https://gmatclub.com/forum/if-m-and-n-ar ... 08985.html
https://gmatclub.com/forum/if-x-and-y-ar ... 00413.html
https://gmatclub.com/forum/if-x-is-a-pos ... 88388.html
https://gmatclub.com/forum/if-5400mn-k-4 ... 09284.html
https://gmatclub.com/forum/if-n-is-a-pos ... 29929.html



chetan2u

in 2nd solution ,Bunuel has choosen lowest value of k ...why so?? k can be 8(k=8)

Please help me understand logic

thx
RC & DI Moderator
Joined: 02 Aug 2009
Status:Math and DI Expert
Posts: 11169
Own Kudos [?]: 31890 [0]
Given Kudos: 290
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
Expert Reply
CEO2021 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

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\)

Answer: B.


chetan2u

in 2nd solution ,Bunuel has choosen lowest value of k ...why so?? k can be 8(k=8)

Please help me understand logic

thx



Hi,

We are looking at the integer that MUST divide n. So you would take the least possible value of that number as n could be anything.
For example, say n is 36, so n^2 becomes 36*36 or 72*18, so divisible by 72.
But n being 36 is not divisible by \(6\sqrt{2*8}\) or 24.

Thus you take the least value of k, so that number surely divides n.
Manager
Manager
Joined: 06 Apr 2023
Posts: 92
Own Kudos [?]: 2 [0]
Given Kudos: 283
Location: India
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
Bunuel wrote:
SOLUTION

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\)

Answer: B.

Similar questions to practice:

https://gmatclub.com/forum/if-n-is-a-po ... 27364.html
https://gmatclub.com/forum/if-n-is-a-po ... 90523.html
https://gmatclub.com/forum/n-is-a-posit ... 04272.html
https://gmatclub.com/forum/if-n-and-y-a ... 92562.html
https://gmatclub.com/forum/if-m-and-n-a ... 08985.html
https://gmatclub.com/forum/if-x-and-y-a ... 00413.html
https://gmatclub.com/forum/if-x-is-a-po ... 88388.html
https://gmatclub.com/forum/if-5400mn-k- ... 09284.html
https://gmatclub.com/forum/if-n-is-a-po ... 29929.html



Hi Bunuel,

what about n=24, n^2=576 which too is divisible by 72. hence in this case the largest integer should be 24. In this question certain limitations should be set which isn't. Sometimes OG questions seems to be off the mark which shouldn't be.
Math Expert
Joined: 02 Sep 2009
Posts: 92900
Own Kudos [?]: 618816 [0]
Given Kudos: 81588
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
Expert Reply
Deep32470 wrote:
Bunuel wrote:
SOLUTION

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\)

Answer: B.

Similar questions to practice:

https://gmatclub.com/forum/if-n-is-a-po ... 27364.html
https://gmatclub.com/forum/if-n-is-a-po ... 90523.html
https://gmatclub.com/forum/n-is-a-posit ... 04272.html
https://gmatclub.com/forum/if-n-and-y-a ... 92562.html
https://gmatclub.com/forum/if-m-and-n-a ... 08985.html
https://gmatclub.com/forum/if-x-and-y-a ... 00413.html
https://gmatclub.com/forum/if-x-is-a-po ... 88388.html
https://gmatclub.com/forum/if-5400mn-k- ... 09284.html
https://gmatclub.com/forum/if-n-is-a-po ... 29929.html



Hi Bunuel,

what about n=24, n^2=576 which too is divisible by 72. hence in this case the largest integer should be 24. In this question certain limitations should be set which isn't. Sometimes OG questions seems to be off the mark which shouldn't be.


I think your question has been answered a few times already, but I'll give it another shot.

The question asks to find the largest positive integer that MUST divide n. So, it's about what ALWAYS divides n, if n^2 is divisible by 72. Now, while n COULD be divisible by various integers, like 48, 72, 1,000,000, etc., it MUST be divisible only by factors of 12. Why? Because the smallest value of n for which n^2 is divisible by 72 is 12.

P.S. Also, it's an official question, and thus it's flawless, as are all official questions. There's nothing wrong with it.
GMAT Club Legend
GMAT Club Legend
Joined: 03 Jun 2019
Posts: 5343
Own Kudos [?]: 3964 [0]
Given Kudos: 160
Location: India
GMAT 1: 690 Q50 V34
WE:Engineering (Transportation)
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
Asked: If n is a positive integer and n^2 is divisible by 72, then the largest positive integer that must divide n is

\(72 = 2ˆ3*3ˆ2\)
Since nˆ2 is divisible by 72, n should be divisible by 2ˆ2*3 = 12

IMO B
Director
Director
Joined: 01 Mar 2015
Posts: 529
Own Kudos [?]: 366 [0]
Given Kudos: 748
Location: India
GMAT 1: 740 Q47 V44
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
amitvmane 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*n
= 72 * x (x is any positive integer)
= 3*3 * 2*2*2 * x
= 3*3 * 2*2*2 * 2*m*m so that the RHS is a perfect square (m is any positive integer)
= 3*3 * 2*2*2*2 * m*m
= 3*3 * 4*4 * m*m
= (12m)(12m)

==> n = 12. So the largest positive integer that must divide n is 12
Intern
Intern
Joined: 08 Feb 2023
Posts: 33
Own Kudos [?]: 1 [0]
Given Kudos: 22
Send PM
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
Bunuel wrote:
SOLUTION

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\)

Answer: B.

Similar questions to practice:

https://gmatclub.com/forum/if-n-is-a-po ... 27364.html
https://gmatclub.com/forum/if-n-is-a-po ... 90523.html
https://gmatclub.com/forum/n-is-a-posit ... 04272.html
https://gmatclub.com/forum/if-n-and-y-a ... 92562.html
https://gmatclub.com/forum/if-m-and-n-a ... 08985.html
https://gmatclub.com/forum/if-x-and-y-a ... 00413.html
https://gmatclub.com/forum/if-x-is-a-po ... 88388.html
https://gmatclub.com/forum/if-5400mn-k- ... 09284.html
https://gmatclub.com/forum/if-n-is-a-po ... 29929.html


I think it's the same but i just wanted to make sure about my thought process.

I found instantly that 12^2 was 144 therefore the first 3 digit integer divisible by 72.
so n=12 and 12/6 gives me 2 and 12/2 gives me 1 therefore 12 is the highest number of the solutions that works because the others are too high.

Thanks for your answer!
GMAT Club Bot
Re: If n is a positive integer and n^2 is divisible by 72, then the larges [#permalink]
   1   2 
Moderators:
Math Expert
92900 posts
Senior Moderator - Masters Forum
3137 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne