If n is the smallest integer such that 432 times n is the square of an integer, what is the value of n?
(A) 2
(B) 3
(C) 6
(D) 12
(E) 24
How can i start the solution to this problem? What is the correct formula in solving it?
OA B
If n is the smallest integer
This topic has expert replies
-
- Moderator
- Posts: 7187
- Joined: Thu Sep 07, 2017 4:43 pm
- Followed by:23 members
GMAT/MBA Expert
- Jay@ManhattanReview
- GMAT Instructor
- Posts: 3008
- Joined: Mon Aug 22, 2016 6:19 am
- Location: Grand Central / New York
- Thanked: 470 times
- Followed by:34 members
So we gave 432n a perfect square, thus, √(432n) is an integer.lheiannie07 wrote:If n is the smallest integer such that 432 times n is the square of an integer, what is the value of n?
(A) 2
(B) 3
(C) 6
(D) 12
(E) 24
How can i start the solution to this problem? What is the correct formula in solving it?
OA B
Let's factorize 432n.
432n = 2*216n = (2^2)*108n = (2^3)*54n = (2^4)*27n = (2^4)*(3^3)n
Thus, √(432n) = √[(2^4)*(3^3)n] = 2^2*√[(3^3)n]
Since the exponent of 3 is 3, an odd number, we can't have its square root an integer. Thus, to make (3^3)*n a perfect square, n must be one among 3^1, 3^3, 3^5, 3^7, ..., 3^(an odd integer). The minimum value of n = 3^1 = 3.
The correct answer: B
Hope this helps!
-Jay
Download free ebook: Manhattan Review GMAT Quantitative Question Bank Guide
_________________
Manhattan Review GMAT Prep
Locations: New York | Barcelona | Manila | Melbourne | and many more...
Schedule your free consultation with an experienced GMAT Prep Advisor! Click here.
-
- Master | Next Rank: 500 Posts
- Posts: 138
- Joined: Mon May 01, 2017 11:56 pm
- Thanked: 4 times
When you are not able to solve a particular problem then, look for options from the answer choices,
we have to find the least value of n for which 432n will be a perfect square.
if n=2, then 432 x 2=864not a perfect square
if n=3, then 432 x 3=1296which is the square of 36
therefore answer is n=3.
we have to find the least value of n for which 432n will be a perfect square.
if n=2, then 432 x 2=864not a perfect square
if n=3, then 432 x 3=1296which is the square of 36
therefore answer is n=3.
GMAT/MBA Expert
- Brent@GMATPrepNow
- GMAT Instructor
- Posts: 16207
- Joined: Mon Dec 08, 2008 6:26 pm
- Location: Vancouver, BC
- Thanked: 5254 times
- Followed by:1268 members
- GMAT Score:770
IMPORTANT CONCEPT: The prime factorization of a perfect square (the square of an integer) will have an even number of each primelheiannie07 wrote:If n is the smallest integer such that 432 times n is the square of an integer, what is the value of n?
(A) 2
(B) 3
(C) 6
(D) 12
(E) 24
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 numbers allow 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!!------------------------
Give: 432n is a perfect square
Let's find the prime factorization of 432
We get: 432 = (2)(2)(2)(2)(3)(3)(3)
So, the prime factorization of 432 has four 2's and three 3's
We already have an EVEN number of 2's. So, if we add one more 3 to the prime factorization, we'll have an EVEN number of 3's
So, if n = 3, then 432n = (2)(2)(2)(2)(3)(3)(3)(3)
Since 432n has an EVEN number of each prime, 432n must be a perfect square.
Answer: B
Cheers,
Brent
- EconomistGMATTutor
- GMAT Instructor
- Posts: 555
- Joined: Wed Oct 04, 2017 4:18 pm
- Thanked: 180 times
- Followed by:12 members
Hi lheiannie07,lheiannie07 wrote:If n is the smallest integer such that 432 times n is the square of an integer, what is the value of n?
(A) 2
(B) 3
(C) 6
(D) 12
(E) 24
How can i start the solution to this problem? What is the correct formula in solving it?
OA B
Let's take a look at your question.
The question states that n is the smallest integer such that 432 times n is the square of an integer.
It means 432n should be a perfect square for the smallest integer n.
Let's try out all the options by starting from option A i.e. 2.
For n = 2
432n = 432(2) = 864
Let's find out if 864 is a perfect square or not by its prie factorization.
864 = (2x2) x (2 x2) x (3x3) x 3
Therefore, it is not a perfect square.
Let's move on to option B now.
For n = 3
432n = 432(3) = 1296
Let's find out if 864 is a perfect square or not by its prie factorization.
1296 = (2x2) x (2 x2) x (3x3) x (3x3)
1296 = (2x2x3x3)^2
1296 = 36^2
Therefore, it is a perfect square of 36.
Hence, Option B is correct.
I am available if you'd like any followup.
GMAT Prep From The Economist
We offer 70+ point score improvement money back guarantee.
Our average student improves 98 points.
We offer 70+ point score improvement money back guarantee.
Our average student improves 98 points.
GMAT/MBA Expert
- Scott@TargetTestPrep
- GMAT Instructor
- Posts: 7223
- Joined: Sat Apr 25, 2015 10:56 am
- Location: Los Angeles, CA
- Thanked: 43 times
- Followed by:29 members
Breaking 432 into its prime factors, we have:BTGmoderatorDC wrote: ↑Wed Oct 04, 2017 1:56 pmIf n is the smallest integer such that 432 times n is the square of an integer, what is the value of n?
(A) 2
(B) 3
(C) 6
(D) 12
(E) 24
How can i start the solution to this problem? What is the correct formula in solving it?
OA B
432 = 8 x 54 = 8 x 9 x 6 = 2^4 x 3^3. A perfect square always has prime factors with even exponents, so, in order for 432 x n to be a perfect square, we need one more prime factor of 3. Thus, n is 3.
Answer: B
Scott Woodbury-Stewart
Founder and CEO
[email protected]
See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews