December 09, 2018 December 09, 2018 07:00 AM PST 09:00 AM PST Attend this Free Algebra Webinar and learn how to master Inequalities and Absolute Value problems on GMAT. December 10, 2018 December 10, 2018 10:00 PM PST 11:00 PM PST Practice the one most important Quant section  Integer properties, and rapidly improve your skills.
Author 
Message 
TAGS:

Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 51035

If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
16 Mar 2014, 23:16
Question Stats:
60% (01:29) correct 40% (01:45) wrong based on 1148 sessions
HideShow timer Statistics
The Official Guide For GMAT® Quantitative Review, 2ND EditionIf 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 Problem Solving Question: 169 Category: Arithmetic Properties of numbers Page: 84 Difficulty: 600 GMAT Club is introducing a new project: The Official Guide For GMAT® Quantitative Review, 2ND Edition  Quantitative Questions ProjectEach week we'll be posting several questions from The Official Guide For GMAT® Quantitative Review, 2ND Edition and then after couple of days we'll provide Official Answer (OA) to them along with a slution. We'll be glad if you participate in development of this project: 1. Please provide your solutions to the questions; 2. Please vote for the best solutions by pressing Kudos button; 3. Please vote for the questions themselves by pressing Kudos button; 4. Please share your views on difficulty level of the questions, so that we have most precise evaluation. Thank you!
Official Answer and Stats are available only to registered users. Register/ Login.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics




Math Expert
Joined: 02 Sep 2009
Posts: 51035

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
16 Mar 2014, 23:16
SOLUTIONIf 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: ifnisapositiveintegerandn2isdivisibleby96then127364.htmlifnisapositiveintegerandn2isdivisibleby72then90523.htmlnisapositiveintegerandkistheproductofallinteger104272.htmlifnandyarepositiveintegersand450yn92562.htmlifmandnarepositiveintegerand1800mn3whatis108985.htmlifxandyarepositiveintegersand180xy100413.htmlifxisapositiveintegerandx2isdivisibleby32then88388.htmlif5400mnk4wheremnandkarepositiveintegers109284.htmlifnisapositiveintegerandn2isdivisibleby72then129929.html
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics




Current Student
Joined: 25 Sep 2012
Posts: 246
Location: India
Concentration: Strategy, Marketing
GMAT 1: 660 Q49 V31 GMAT 2: 680 Q48 V34

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
17 Mar 2014, 03:51
\(\frac{n*n}{72}\) = \(\frac{n*n}{2*2*2*3*3}\) This means n should be at least 2*2*3. Otherwise \(n^2\) won't be divisible by 72
What is the largest integer that can divide n? Let's see, largest integer that can divide 2? 2 Largest integer that can divide 3? 3 Largest integer that can divide n is n itself
Answer B Time Taken 2:31 Difficulty level 650




SVP
Status: The Best Or Nothing
Joined: 27 Dec 2012
Posts: 1826
Location: India
Concentration: General Management, Technology
WE: Information Technology (Computer Software)

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
18 Mar 2014, 01:10
Answer = B = 12 We require to find the least value of n Say n=6, however 36 is not divisible by 72; Ignore A Say n=12, 144 is divisible by 72 So Answer = 12
_________________
Kindly press "+1 Kudos" to appreciate



Manager
Joined: 04 Oct 2013
Posts: 152
Location: India
GMAT Date: 05232015
GPA: 3.45

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
Updated on: 23 Mar 2014, 19:01
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 that, n is a positive integer and n^2 is divisible by 72 means that n^2 is a perfect square that is lowest multiple of 72.
Or, the lowest multiple of 72 that is a perfect square is 144.
So, n^2 = 144q, q is some positive integer => 12 is a factor of n.
Answer: (B)
Originally posted by arunspanda on 18 Mar 2014, 07:00.
Last edited by arunspanda on 23 Mar 2014, 19:01, edited 2 times in total.



Math Expert
Joined: 02 Sep 2009
Posts: 51035

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
23 Mar 2014, 06:57
SOLUTIONIf 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: ifnisapositiveintegerandn2isdivisibleby96then127364.htmlifnisapositiveintegerandn2isdivisibleby72then90523.htmlnisapositiveintegerandkistheproductofallinteger104272.htmlifnandyarepositiveintegersand450yn92562.htmlifmandnarepositiveintegerand1800mn3whatis108985.htmlifxandyarepositiveintegersand180xy100413.htmlifxisapositiveintegerandx2isdivisibleby32then88388.htmlif5400mnk4wheremnandkarepositiveintegers109284.htmlifnisapositiveintegerandn2isdivisibleby72then129929.html
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Intern
Joined: 07 Jun 2014
Posts: 14
Location: India
GPA: 2.91
WE: Consulting (Energy and Utilities)

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
28 Jul 2014, 09:02
Bunuel wrote: SOLUTIONIf 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: ifnisapositiveintegerandn2isdivisibleby96then127364.htmlifnisapositiveintegerandn2isdivisibleby72then90523.htmlnisapositiveintegerandkistheproductofallinteger104272.htmlifnandyarepositiveintegersand450yn92562.htmlifmandnarepositiveintegerand1800mn3whatis108985.htmlifxandyarepositiveintegersand180xy100413.htmlifxisapositiveintegerandx2isdivisibleby32then88388.htmlif5400mnk4wheremnandkarepositiveintegers109284.htmlifnisapositiveintegerandn2isdivisibleby72then129929.html Hi, How can the part highlighted in bold be concluded fro the question stem "The largest positive integer that must divide n, means for the least value of n"?? In absence of this even 48 looks like a valid answer, as 48^2 is divisible by 72 and 48 is divisible by itself. Please help!! Regards, Sagar
_________________
I would rather "crash and burn" than "sulk and cry"!!



Math Expert
Joined: 02 Sep 2009
Posts: 51035

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
28 Jul 2014, 09:12
itsworththepain wrote: Bunuel wrote: SOLUTIONIf 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: ifnisapositiveintegerandn2isdivisibleby96then127364.htmlifnisapositiveintegerandn2isdivisibleby72then90523.htmlnisapositiveintegerandkistheproductofallinteger104272.htmlifnandyarepositiveintegersand450yn92562.htmlifmandnarepositiveintegerand1800mn3whatis108985.htmlifxandyarepositiveintegersand180xy100413.htmlifxisapositiveintegerandx2isdivisibleby32then88388.htmlif5400mnk4wheremnandkarepositiveintegers109284.htmlifnisapositiveintegerandn2isdivisibleby72then129929.html Hi, How can the part highlighted in bold be concluded fro the question stem "The largest positive integer that must divide n, means for the least value of n"?? In absence of this even 48 looks like a valid answer, as 48^2 is divisible by 72 and 48 is divisible by itself. Please help!! Regards, Sagar We need the largest positive integer that MUST divide n. So, we should find the least value of n for which n^2 is divisible by 72, and if that n is divisible by some number then so will be every other n's (MUST condition will be satisfied). The least positive n for which n^2 is divisible by 72 is 12 (12^2 = 144, which is divisible by 72). So, even if n = 12 it is divisible by 12 but not divisible by 24, 36 or 48. Follow the links in my previous post for similar questions to understand the concept better.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Manager
Joined: 26 Feb 2015
Posts: 115

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
14 Mar 2015, 07:56
Bunuel wrote: itsworththepain wrote: Bunuel wrote: SOLUTION
We need the largest positive integer that MUST divide n. So, we should find the least value of n for which n^2 is divisible by 72, and if that n is divisible by some number then so will be every other n's (MUST condition will be satisfied). The least positive n for which n^2 is divisible by 72 is 12 (12^2 = 144, which is divisible by 72). So, even if n = 12 it is divisible by 12 but not divisible by 24, 36 or 48.
Follow the links in my previous post for similar questions to understand the concept better. I don't actually understand this either, why is it implied that we need the least value for n? I mean, as the previous poster said. 48^2 too, is divisible by 72 and 48/48 = 1. Why is it (I mean, how do I interpret from the question that we need the least value for n)



Director
Joined: 10 Mar 2013
Posts: 504
Location: Germany
Concentration: Finance, Entrepreneurship
GPA: 3.88
WE: Information Technology (Consulting)

If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
Updated on: 03 Nov 2015, 00:01
Let's make it look easy 72= 2*2*2*3*3 we need one more 2 in order to make a perfect square we need an even number of primes > we need one (2) > 72*2 =144, Take a square root of it an you'll get 12 (B)
_________________
When you’re up, your friends know who you are. When you’re down, you know who your friends are.
Share some Kudos, if my posts help you. Thank you !
800Score ONLY QUANT CAT1 51, CAT2 50, CAT3 50 GMAT PREP 670 MGMAT CAT 630 KAPLAN CAT 660
Originally posted by BrainLab on 21 Jun 2015, 04:16.
Last edited by BrainLab on 03 Nov 2015, 00:01, edited 1 time in total.



CEO
Status: GMATINSIGHT Tutor
Joined: 08 Jul 2010
Posts: 2709
Location: India
GMAT: INSIGHT
WE: Education (Education)

If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
21 Jun 2015, 06:35
Bunuel wrote: The Official Guide For GMAT® Quantitative Review, 2ND EditionIf 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 CONCEPT: Perfect Squares always have even power of Prime no. in their Prime factorised form.\(72 = 8*9 = 2^3*3^2\)Since power of prime numbers must be prime so \(72\)must be multiplied by minimum \(2^1\) to make the result a perfect Square In that Case \(n^2 = 2^4 * 3^2\) i.e. \(n = 2^2 * 3 = 12\) Answer: Option
_________________
Prosper!!! GMATinsight Bhoopendra Singh and Dr.Sushma Jha email: info@GMATinsight.com I Call us : +919999687183 / 9891333772 Online OneonOne Skype based classes and Classroom Coaching in South and West Delhi http://www.GMATinsight.com/testimonials.html
ACCESS FREE GMAT TESTS HERE:22 ONLINE FREE (FULL LENGTH) GMAT CAT (PRACTICE TESTS) LINK COLLECTION



Manager
Joined: 05 Jul 2015
Posts: 101
Concentration: Real Estate, International Business
GPA: 3.3

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
22 Nov 2015, 19:34
I did it with exponents as other people have done. 72 = 9*8 = 3^2*2^3
n^2=72x n = 3*2^2 (x) and X could be anything positive but 12 MUST divide n



Intern
Joined: 04 Oct 2015
Posts: 1

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
23 Nov 2015, 02:24
I would like to emphasize one point here (which I think is not very explicit in previous answers). The following step is straightforward, n^2 = 72 M = 2*6*6*M, where M is an integer. For perfect square, even prime factors are needed. That is, n^2= 2*6*6*2*m (for some integer m different from M) Since, n>0, n= (2*6)*k , where k is some other integer. That implies, n=12k where k is an integer. Meaning, n is not just a single number but any multiple of 12. This is where the question phrase, "then the largest positive integer that must divide n is.." plays the part. Since k= 1 or 2 or 3 or any other integer, no matter how large the number, "12" would be the number that would always divide "n". 6 would do the same (so would 3 or 4 or 2 hypothetically). But the largest one to always divide "n" would be "12" [among 1, 2, 3, 4, 6 or 12].



Manager
Joined: 18 Oct 2016
Posts: 139
Location: India
WE: Engineering (Energy and Utilities)

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
18 Apr 2017, 06:43
Option B\(n^2 = 72x = 2^3*3^2*x = 2^4*3^2*w\) : A perfect square contains Even powers of all the prime factors. [x, w & k are integers] \(n = 2^2*3*k = 12k\) \(k = \frac{n}{12}\) = integer. 12 is the largest integer which must divide n evenly.
_________________
Press Kudos if you liked the post!
Rules for posting  PLEASE READ BEFORE YOU POST



Intern
Joined: 24 Jul 2017
Posts: 48
Location: India
WE: Information Technology (Computer Software)

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
22 Sep 2017, 10:49
72 = 2^3 * 3^2
Given that n^2 is divisible by 72. So in order to satisfy this condition, n has to have a minimum value of 2^2 * 3^2 squaring which would be divisible by 72. Hence n = 12 and largest possible value that can divide n is 12.
Kudos if it helps



VP
Joined: 09 Mar 2016
Posts: 1202

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
11 May 2018, 10:01
Bunuel wrote: itsworththepain wrote: Bunuel wrote: SOLUTIONIf 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: http://gmatclub.com/forum/ifnisapos ... 27364.htmlhttp://gmatclub.com/forum/ifnisapos ... 90523.htmlhttp://gmatclub.com/forum/nisapositi ... 04272.htmlhttp://gmatclub.com/forum/ifnandyar ... 92562.htmlhttp://gmatclub.com/forum/ifmandnar ... 08985.htmlhttp://gmatclub.com/forum/ifxandyar ... 00413.htmlhttp://gmatclub.com/forum/ifxisapos ... 88388.htmlhttp://gmatclub.com/forum/if5400mnk4 ... 09284.htmlhttp://gmatclub.com/forum/ifnisapos ... 29929.html Hi, How can the part highlighted in bold be concluded fro the question stem "The largest positive integer that must divide n, means for the least value of n"?? In absence of this even 48 looks like a valid answer, as 48^2 is divisible by 72 and 48 is divisible by itself. Please help!! Regards, Sagar We need the largest positive integer that MUST divide n. So, we should find the least value of n for which n^2 is divisible by 72, and if that n is divisible by some number then so will be every other n's (MUST condition will be satisfied). The least positive n for which n^2 is divisible by 72 is 12 (12^2 = 144, which is divisible by 72). So, even if n = 12 it is divisible by 12 but not divisible by 24, 36 or 48. Follow the links in my previous post for similar questions to understand the concept better. niks18 hello is there a way to rephrase ths sentence so as i can understand The largest positive integer that must divide \(n\), means for the least value of \(n\) which satisfies the given statement in the question. it says " largest positive integer " and at the same time mentiones "the least value"



VP
Joined: 07 Dec 2014
Posts: 1128

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
11 May 2018, 19:28
Bunuel wrote: The Official Guide For GMAT® Quantitative Review, 2ND EditionIf 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 let n^2=72x 72=6*6*2 to get two matched factor pairs, let x=2 n^2=6*6*2*2=144 √144=n=12 B



PS Forum Moderator
Joined: 25 Feb 2013
Posts: 1217
Location: India
GPA: 3.82

Re: If n is a positive integer and n^2 is divisible by 72, then
[#permalink]
Show Tags
14 May 2018, 06:32
dave13 wrote: Bunuel wrote: Bunuel wrote: SOLUTIONIf 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: http://gmatclub.com/forum/ifnisapos ... 27364.htmlhttp://gmatclub.com/forum/ifnisapos ... 90523.htmlhttp://gmatclub.com/forum/nisapositi ... 04272.htmlhttp://gmatclub.com/forum/ifnandyar ... 92562.htmlhttp://gmatclub.com/forum/ifmandnar ... 08985.htmlhttp://gmatclub.com/forum/ifxandyar ... 00413.htmlhttp://gmatclub.com/forum/ifxisapos ... 88388.htmlhttp://gmatclub.com/forum/if5400mnk4 ... 09284.htmlhttp://gmatclub.com/forum/ifnisapos ... 29929.html We need the largest positive integer that MUST divide n. So, we should find the least value of n for which n^2 is divisible by 72, and if that n is divisible by some number then so will be every other n's (MUST condition will be satisfied). The least positive n for which n^2 is divisible by 72 is 12 (12^2 = 144, which is divisible by 72). So, even if n = 12 it is divisible by 12 but not divisible by 24, 36 or 48. Follow the links in my previous post for similar questions to understand the concept better. niks18 hello is there a way to rephrase ths sentence so as i can understand The largest positive integer that must divide \(n\), means for the least value of \(n\) which satisfies the given statement in the question. it says " largest positive integer " and at the same time mentiones "the least value" Hi dave13you need to note few things here  \(n^2\) will always be divisible by 72, so whatever the value of n is, its square has to be a multiple of 72 therefore \(n^2=72k\), for some constant k \(=>n=6\sqrt{2k}\), now as \(n\) is integer, hence \(2k\) has to be a perfect square, so let's assume \(k=2x^2\), for some integer \(x\) \(=>n=6*2x=12x\) Now look at the options given: 6, 12, 24, 36, 48. 6 is not possible because least value of \(n\) is 12 and 12>6. so 12 is the definite contender to be the largest divisor on \(n\) why 24, 36 & 48 are not possible here? we have got \(n=12x\), so essentially value of \(n\) will depend on integer \(x\) if x=1, \(n\) will not be divisible by 24, 36 & 48. if x=2, then \(n\) will not be divisible by 36 & 48. if x=3, \(n\) will not be divisible by 24 & 48 and so on. Hence \(n\) has to be 12 for \(n^2\) to be ALWAYS divisible by 72. This is a MUST BE TRUE question. Hence we need a definite value here. So from the above explanation, we have derived, that "The largest integer that must divide \(n\), for \(n^2\) to be always divisible by 72", we actually need the LEAST value of \(n\)




Re: If n is a positive integer and n^2 is divisible by 72, then &nbs
[#permalink]
14 May 2018, 06:32






