Forum Home > GMAT > Quantitative > Problem Solving (PS)
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.
Dec 1511: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.
Dec 1410:00 AM EST
-12:00 PM EST
Think a 100% GMAT Verbal score is out of your reach? Target Test Prep will make you think again! Our course uses techniques such as topical study and spaced repetition to maximize knowledge retention and make studying simple and fun.- Dec 14
11:00 AM IST
-01:00 PM IST
Attend this session to learn how to Deconstruct arguments, Pre-Think Author’s Assumptions, and apply Negation Test. 
Dec 1608:00 AM PST
-11:59 PM PST
GMAT Club 12 Days of Christmas is a 4th Annual GMAT Club Winter Competition based on solving questions. This is the Winter GMAT competition on GMAT Club with an amazing opportunity to win over $40,000 worth of prizes!- Dec 17
09:00 AM PST
-10:00 AM PST
Join Manhattan Prep instructor Whitney Garner for a fun—and thorough—review of logic-based (non-math) problems, with a particular emphasis on Data Sufficiency and Two-Parts. - Dec 18
10:00 AM PST
-11:00 AM PST
Here is the essential guide to securing scholarships as an MBA student! In this video, we explore the various types of scholarships available, including need-based and merit-based options.
05 May 2017, 02:07
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:
37% (03:20) correct
63%
(02:50)
wrong
based on 72
sessions
History
Date
Time
Result
Not Attempted Yet
The sum of \(q\) and \(m\) equals to some positive odd number, where \(q\) and \(m\) are prime numbers.
When \(30\) is divided by \(q^k\) it leaves the remainder \(r\), where \(k\) is a positive integer. What is the value of \(r\) ?
(1) \(15 < q^k < 40\)
(2) \(q < m\) and \(q^k\) leaves \(2\) as a remainder when divided by \(7\)
Self-made
When \(30\) is divided by \(q^k\) it leaves the remainder \(r\), where \(k\) is a positive integer. What is the value of \(r\) ?
(1) \(15 < q^k < 40\)
(2) \(q < m\) and \(q^k\) leaves \(2\) as a remainder when divided by \(7\)
Self-made
05 May 2017, 21:45
Kudos
Bookmarks
Alexey1989x
The sum of \(q\) and \(m\) equals to some positive odd number, where \(q\) and \(m\) are prime numbers.
When \(30\) is divided by \(q^k\) it leaves the remainder \(r\), where \(k\) is a positive integer. What is the value of \(r\) ?
(1) \(15 < q^k < 40\)
(2) \(q < m\) and \(q^k\) leaves \(2\) as a remainder when divided by \(7\)
Self-made
Analyzing question stem we can see that either q or m is 2 because q and m are prime numbers and their sum is odd. Since E+O = O and except 2 all other prime numbers are odd.When \(30\) is divided by \(q^k\) it leaves the remainder \(r\), where \(k\) is a positive integer. What is the value of \(r\) ?
(1) \(15 < q^k < 40\)
(2) \(q < m\) and \(q^k\) leaves \(2\) as a remainder when divided by \(7\)
Self-made
Now 30 = q^k*(Quotient) +r. this implies that q^k<30 because if q^k>=30 then either there will be no remainder (if q^k=30) or the remainder will be 30 itself.
Statement 1: if q=2 then from this statement q^k could be 16 or 32 i.e. powers of 2 but if q is not equal to 2 then it could be 27, 25. Hence the statement is not sufficient
Statement 2: As q<m this means q has to be 2 and m could be any prime no greater than 2. Also from this statement we get to know that q^k = 7n+2 (where "n" is the quotient). so we have 2^k = 7n+2
if n = 2; q^k = 16 and if n = 18; q^k = 128. Hence this statement is not sufficient.
Combining Statement 1 & 2 we get q^k = 16.
So option C
