Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Nov 1912:30 PM EST
-01:30 PM EST
Learn how Keshav, a Chartered Accountant, scored an impressive 705 on GMAT in just 30 days with GMATWhiz's expert guidance. In this video, he shares preparation tips and strategies that worked for him, including the mock, time management, and more
Nov 2001:30 PM EST
-02:30 PM IST
Learn how Kamakshi achieved a GMAT 675 with an impressive 96th %ile in Data Insights. Discover the unique methods and exam strategies that helped her excel in DI along with other sections for a balanced and high score.
Nov 2211:00 AM IST
-01:00 PM IST
Do RC/MSR passages scare you? e-GMAT is conducting a masterclass to help you learn – Learn effective reading strategies Tackle difficult RC & MSR with confidence Excel in timed test environment- Nov 23
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Nov 2407:00 PM PST
-08:00 PM PST
Full-length FE mock with insightful analytics, weakness diagnosis, and video explanations!
Nov 2510:00 AM EST
-11:00 AM EST
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors.
07 Nov 2019, 02:16
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
95%
(hard)
Question Stats:
39% (02:03) correct
61%
(02:07)
wrong
based on 412
sessions
History
Date
Time
Result
Not Attempted Yet
If n is a positive integer, and n^2 has 25 factors, which of the following must be true.
I. n has 12 factors.
II. n > 50
III. \(\sqrt n\) is an integer.
A. I and II only
B. II only
C. III only
D. II and III
E. None
Are You Up For the Challenge: 700 Level Questions
I. n has 12 factors.
II. n > 50
III. \(\sqrt n\) is an integer.
A. I and II only
B. II only
C. III only
D. II and III
E. None
Are You Up For the Challenge: 700 Level Questions
Updated on: 13 Nov 2019, 09:50
Originally posted by TestPrepUnlimited on 11 Nov 2019, 05:58.
Last edited by TestPrepUnlimited on 13 Nov 2019, 09:50, edited 1 time in total.
Last edited by TestPrepUnlimited on 13 Nov 2019, 09:50, edited 1 time in total.
Kudos
Bookmarks
In this case, we can create a number with 25 factors.
If the prime factorization of x is x =(2^a)*(3^b)*(5^c) .... the number of factors is (a+1)(b+1)(c+1) ...
For example, 48 = 16 * 3 = \(2^4 * 3\) has \((4+1)*(1+1) = 5 * 2 = 10\) factors.
So in this case, the number of factors, 25, must be broken down into 5 * 5 = 25 or 25 * 1 = 25. Using 5 * 5 = 25, we can have (a + 1)(b + 1) = 25, a = 4 and b = 4. This means \(x = 2^4*3^4 = n^2\). Thus \(n = 2^2*3^2\) which has 3*3 = 9 factors. We may check for the other case, \(n^2 = 2^{24}\) -> \(n = 2^{12}\) gives 13 factors). In both cases n has an odd number of factors so it is a square, hence III is true. Finally, we had \(n = 2^2*3^2 = 36\) so II is false. (Note all of these n's are just minimum values of n, in fact n can be (any prime number)^4 * (any other prime number)^4 etc)
Ans: C
If the prime factorization of x is x =(2^a)*(3^b)*(5^c) .... the number of factors is (a+1)(b+1)(c+1) ...
For example, 48 = 16 * 3 = \(2^4 * 3\) has \((4+1)*(1+1) = 5 * 2 = 10\) factors.
So in this case, the number of factors, 25, must be broken down into 5 * 5 = 25 or 25 * 1 = 25. Using 5 * 5 = 25, we can have (a + 1)(b + 1) = 25, a = 4 and b = 4. This means \(x = 2^4*3^4 = n^2\). Thus \(n = 2^2*3^2\) which has 3*3 = 9 factors. We may check for the other case, \(n^2 = 2^{24}\) -> \(n = 2^{12}\) gives 13 factors). In both cases n has an odd number of factors so it is a square, hence III is true. Finally, we had \(n = 2^2*3^2 = 36\) so II is false. (Note all of these n's are just minimum values of n, in fact n can be (any prime number)^4 * (any other prime number)^4 etc)
Ans: C
Bunuel
General Discussion
07 Nov 2019, 10:27
Kudos
Bookmarks
for given condition
n^2 has 25 factors
IMO C III is valid
n^2 has 25 factors
IMO C III is valid
Bunuel
