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 2007:30 AM PST
-08:30 AM PST
Learn what truly sets the UC Riverside MBA apart and how it helps in your professional growth
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 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 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.
29 Jul 2016, 02:20
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:
20% (01:39) correct
80%
(01:34)
wrong
based on 530
sessions
History
Date
Time
Result
Not Attempted Yet
If \(n = x^5*y^7\), where \(x\) and \(y\) are positive integers greater than 1, how many positive divisors does \(n\) have?
(1) \(x\) does not have a factor \(p\) such that \(1 < p < x\) and \(y\) does not have a factor \(q\) such that \(1 < q < y\).
(2) \(n\) has only two prime factors.
(1) \(x\) does not have a factor \(p\) such that \(1 < p < x\) and \(y\) does not have a factor \(q\) such that \(1 < q < y\).
(2) \(n\) has only two prime factors.
Experience GMAT Club Test Questions
Yes, you've landed on a GMAT Club Tests question
Craving more? Unlock our full suite of GMAT Club Tests here
Want to experience more? Get a taste of our tests with our free trial today
Rise to the challenge with GMAT Club Tests. Happy practicing!
17 Jul 2017, 10:28
Kudos
Bookmarks
Official Solution:
If \(n = x^5*y^7\), where \(x\) and \(y\) are positive integers greater than 1, how many positive factors does \(n\) have?
(1) \(x\) does not have a factor \(p\) such that \(1 < p < x\) and \(y\) does not have a factor \(q\) such that \(1 < q < y\).
This statement implies that both \(x\) and \(y\) are primes (a prime number does not have a factor that is greater than 1 and less than itself; it has only two factors: 1 and itself). Now, if \(x\) and \(y\) are different primes, then the number of factors of \(n\) will be \((5+1)(7+1)=48\). However, if \(x=y\), then \(n = x^5*y^7=x^{12}\) and it will have 13 factors. Not sufficient.
(2) \(n\) has only two prime factors.
If those primes are \(x\) and \(y\), then the number of factors of \(n\) will be \((5+1)(7+1)=48\). But if, say, \(x=2*3=6\) and \(y=2\), then \(n = x^5*y^7=2^{12}*3^5\) and it will have \((12+1)(5+1)=78\) factors. Not sufficient.
(1)+(2) Since from (2) \(n\) has only two prime factors, then from (1) it follows that \(x\) and \(y\) are different primes; so the number of factors of \(n\) will be \((5+1)(7+1)=48\). Sufficient.
Answer: C
If \(n = x^5*y^7\), where \(x\) and \(y\) are positive integers greater than 1, how many positive factors does \(n\) have?
(1) \(x\) does not have a factor \(p\) such that \(1 < p < x\) and \(y\) does not have a factor \(q\) such that \(1 < q < y\).
This statement implies that both \(x\) and \(y\) are primes (a prime number does not have a factor that is greater than 1 and less than itself; it has only two factors: 1 and itself). Now, if \(x\) and \(y\) are different primes, then the number of factors of \(n\) will be \((5+1)(7+1)=48\). However, if \(x=y\), then \(n = x^5*y^7=x^{12}\) and it will have 13 factors. Not sufficient.
(2) \(n\) has only two prime factors.
If those primes are \(x\) and \(y\), then the number of factors of \(n\) will be \((5+1)(7+1)=48\). But if, say, \(x=2*3=6\) and \(y=2\), then \(n = x^5*y^7=2^{12}*3^5\) and it will have \((12+1)(5+1)=78\) factors. Not sufficient.
(1)+(2) Since from (2) \(n\) has only two prime factors, then from (1) it follows that \(x\) and \(y\) are different primes; so the number of factors of \(n\) will be \((5+1)(7+1)=48\). Sufficient.
Answer: C
General Discussion
unverifiedvoracity
Joined: 12 Jan 2016
Last visit: 14 Aug 2017
Posts: 56
Given Kudos: 71
Location: United States
Concentration: Operations, General Management
Schools: Wharton Exec '21 (A) Haas EWMBA '20 (A)
GMAT 1: 690 Q49 V35
GPA: 3.5
WE:Supply Chain Management (Consumer Electronics)
29 Jul 2016, 15:54
Kudos
Bookmarks
You can calculate the number of divisors of n, if you know that x and y are prime.
(1) x does not have a factor p such that 1 < p < x and y does not have a factor q such that 1 < q < y.
The wording of this statement and the question stem implicitly states that x and y are different integers. Given this statement, x and y are distinct prime numbers, so the number of divisors of n can be calculated using this statement.
This statement is sufficient.
(2) n has only two prime factors.
From the question stem \(n =x^5∗y^7\). This statement cannot be used to ascertain that x and y are the 2 prime factors of n. Let me illustrate with an example -
When \(n = 4^5 * 6^7\) and you are told that n has 2 prime factors, this does not mean 4 and 6 are the two prime factors. The 2 prime factors of n in this case are 2 and 3.
Hence, Statement 2 by itself is not sufficient to answer the question.
My answer is A.
(1) x does not have a factor p such that 1 < p < x and y does not have a factor q such that 1 < q < y.
The wording of this statement and the question stem implicitly states that x and y are different integers. Given this statement, x and y are distinct prime numbers, so the number of divisors of n can be calculated using this statement.
This statement is sufficient.
(2) n has only two prime factors.
From the question stem \(n =x^5∗y^7\). This statement cannot be used to ascertain that x and y are the 2 prime factors of n. Let me illustrate with an example -
When \(n = 4^5 * 6^7\) and you are told that n has 2 prime factors, this does not mean 4 and 6 are the two prime factors. The 2 prime factors of n in this case are 2 and 3.
Hence, Statement 2 by itself is not sufficient to answer the question.
My answer is A.
