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
we will pick new questions that match your level based on your Timer History
Track Your Progress
every week, we’ll send you an estimated GMAT score based on your performance
Practice Pays
we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
In this session with eGMAT Quant Expert, Shweta, we will... 1) Learn to solve the most challenging question types in Absolute value equations 2) Know common absolute value question types in inequality asked in the GMAT
In this live-stream, Scott Edinburgh, Wharton MBA and Founder of Personal MBA Coach, will explain common pitfalls in MBA applications and how to avoid them.
For 7 days from July 30 to Aug 4, type Coupon Code "SUCCESS2 " at check out to get 20% off from the original price. This is your chance to score an excellent Q49-51 just like 70% of our students.
In the second episode of "MBA Career Goals" series, Katie McQuarrie (Kellogg MBA and Senior Consultant with Vantage Point MBA) is going to talk about (1) what are Long-Term MBA career goals exactly, and more.
In each webinar, we teach game-changing techniques and strategies for solving some of the most high-value GMAT quant questions. In addition, we will provide you with the opportunity to ask questions regarding how to best prepare for the GMAT.
In the second episode of #Tuck admissions series, Dr. Christie St-John, who has served on the admission committee of Tuck School for 10 years, will talk about the application essays of Tuck School of Business, and how to write successful admission essays.
Most students struggle to cross GMAT 700 because they lack a strategic plan of action. Attend this Free Strategy Webinar, where we will discuss 3 vital skills that can help you score a 760 on GMAT ‘effectively’.
Re: If r is the remainder when the positive integer n is divided by 7 what
[#permalink]
21 Sep 2010, 21:12
4
Kudos
2
Bookmarks
Expert Reply
If r is the remainder when the postive integer n is divided by 7, what is the value of r ?
Positive integer \(a\) divided by positive integer \(d\) yields a reminder of \(r\) can always be expressed as \(a=qd+r\), where \(q\) is called a quotient and \(r\) is called a remainder, note here that \(0\leq{r}<d\) (remainder is non-negative integer and always less than divisor).
(1) when n is divided by 21 the remainder is an odd number --> \(n=21q+odd=7*3q+odd\), now as \(21q\) is itself divisible by 7 then if \(odd=1\) then \(n\) divided by 7 will yield the same reminder of 1 BUT if \(odd=3\) then \(n\) divided by 7 will yield the same reminder of 3. Two different answers, hence not sufficient.
Or try two different numbers for \(n\): If \(n=22\) then \(n\) divided by 21 gives remainder of 1 and \(n\) divded by 7 also gives remainder of 1; If \(n=24\) then \(n\) divided by 21 gives remainder of 3 and \(n\) divded by 7 also gives remainder of 3. Two different answers, hence not sufficient.
(2) when n is divided by 28, the remainder is 3 --> \(n=28p+3=7*(4p)+3\), now as \(28p\) is itself divisible by 7, then \(n\) divided by 7 will give remainder of 3. Sufficient.
Re: If r is the remainder when integer n is divided by 7, what is the valu
[#permalink]
27 Oct 2014, 08:36
3
Kudos
4
Bookmarks
Bunuel wrote:
Tough and Tricky questions: Remainders.
If r is the remainder when integer n is divided by 7, what is the value of r?
(1) When n is divided by 21, the remainder is an odd number (2) When n is divided by 28, the remainder is 3
solution: From #1, if n = 5, remainder is 5 and is odd. if n = 7, remainder is 7 and is odd. However, remainder when n(5 or 7) is divided by 7 is different. Hence not sufficient From #2, n=3, or 31, or 59 etc, remainder is 3, Even when the above numbers are divided by 7, the remainder is still 3
Re: If r is the remainder when the positive integer n is divided by 7 what
[#permalink]
03 Apr 2016, 13:13
Bunuel wrote:
If r is the remainder when the postive integer n is divided by 7, what is the value of r ?
Positive integer \(a\) divided by positive integer \(d\) yields a reminder of \(r\) can always be expressed as \(a=qd+r\), where \(q\) is called a quotient and \(r\) is called a remainder, note here that \(0\leq{r}<d\) (remainder is non-negative integer and always less than divisor).
(1) when n is divided by 21 the remainder is an odd number --> \(n=21q+odd=7*3q+odd\), now as \(21q\) is itself divisible by 7 then if \(odd=1\) then \(n\) divided by 7 will yield the same reminder of 1 BUT if \(odd=3\) then \(n\) divided by 7 will yield the same reminder of 3. Two different answers, hence not sufficient.
Or try two different numbers for \(n\): If \(n=22\) then \(n\) divided by 21 gives remainder of 1 and \(n\) divded by 7 also gives remainder of 1; If \(n=24\) then \(n\) divided by 21 gives remainder of 3 and \(n\) divded by 7 also gives remainder of 3. Two different answers, hence not sufficient.
(2) when n is divided by 28, the remainder is 3 --> \(n=28p+3=7*(4p)+3\), now as \(28p\) is itself divisible by 7, then \(n\) divided by 7 will give remainder of 3. Sufficient.
Answer: B.
Thanks Bunnel. Could you please explain the logic behind "when n is divided by 28, the remainder is 3 --> \(n=28p+3=7*(4p)+3\), now as \(28p\) is itself divisible by 7, then \(n\) divided by 7 will give remainder of 3. Sufficient." ?
Re: If r is the remainder when the positive integer n is divided by 7 what
[#permalink]
03 Apr 2016, 20:23
Expert Reply
Keysersoze10 wrote:
Bunuel wrote:
If r is the remainder when the postive integer n is divided by 7, what is the value of r ?
Positive integer \(a\) divided by positive integer \(d\) yields a reminder of \(r\) can always be expressed as \(a=qd+r\), where \(q\) is called a quotient and \(r\) is called a remainder, note here that \(0\leq{r}<d\) (remainder is non-negative integer and always less than divisor).
(1) when n is divided by 21 the remainder is an odd number --> \(n=21q+odd=7*3q+odd\), now as \(21q\) is itself divisible by 7 then if \(odd=1\) then \(n\) divided by 7 will yield the same reminder of 1 BUT if \(odd=3\) then \(n\) divided by 7 will yield the same reminder of 3. Two different answers, hence not sufficient.
Or try two different numbers for \(n\): If \(n=22\) then \(n\) divided by 21 gives remainder of 1 and \(n\) divded by 7 also gives remainder of 1; If \(n=24\) then \(n\) divided by 21 gives remainder of 3 and \(n\) divded by 7 also gives remainder of 3. Two different answers, hence not sufficient.
(2) when n is divided by 28, the remainder is 3 --> \(n=28p+3=7*(4p)+3\), now as \(28p\) is itself divisible by 7, then \(n\) divided by 7 will give remainder of 3. Sufficient.
Answer: B.
Thanks Bunnel. Could you please explain the logic behind "when n is divided by 28, the remainder is 3 --> \(n=28p+3=7*(4p)+3\), now as \(28p\) is itself divisible by 7, then \(n\) divided by 7 will give remainder of 3. Sufficient." ?
28p gives the remainder of 0, when divided by 7 and 3 gives the remainder of 3 when divided by 7. _________________
Re: If r is the remainder when integer n is divided by 7, what is the valu
[#permalink]
20 Apr 2018, 06:36
3
Bookmarks
Expert Reply
Top Contributor
Bunuel wrote:
Tough and Tricky questions: Remainders.
If r is the remainder when integer n is divided by 7, what is the value of r?
(1) When n is divided by 21, the remainder is an odd number (2) When n is divided by 28, the remainder is 3
We can use a variety of divisibility rules to solve this, or we can list possible values of n based on the statements. The rule for listing possible values of n is as follows: If, when N is divided by D, the remainder is R, then the possible values of N include: R, R+D, R+2D, R+3D,. . .
Target question:What is the value of r?
Statement 1: When n is divided by 21, the remainder is an odd number. There are several possible values of n that satisfy this condition. Here are two: Case a: n = 1 (since 1 divided by 21 leaves remainder 1, which is odd). Here, r = 1 Case b: n = 3 (since 3 divided by 21 leaves remainder 3, which is odd). Here, r = 3 Since we cannot answer the target question with certainty, statement 1 is NOT SUFFICIENT
Statement 2: When n is divided by 28, the remainder is 3 Possible values of n: 3, 31, 59, 87, . . . We can see that for all possible values of n, the remainder is always 3 when n is divided by 7 Since we can answer the target question with certainty, statement 2 is SUFFICIENT
Re: If r is the remainder when integer n is divided by 7, what is the valu
[#permalink]
16 Jun 2019, 00:33
GMATPrepNow wrote:
Bunuel wrote:
Tough and Tricky questions: Remainders.
If r is the remainder when integer n is divided by 7, what is the value of r?
(1) When n is divided by 21, the remainder is an odd number (2) When n is divided by 28, the remainder is 3
We can use a variety of divisibility rules to solve this, or we can list possible values of n based on the statements. The rule for listing possible values of n is as follows: If, when N is divided by D, the remainder is R, then the possible values of N include: R, R+D, R+2D, R+3D,. . .
Target question:What is the value of r?
Statement 1: When n is divided by 21, the remainder is an odd number. There are several possible values of n that satisfy this condition. Here are two: Case a: n = 1 (since 1 divided by 21 leaves remainder 1, which is odd). Here, r = 1 Case b: n = 3 (since 3 divided by 21 leaves remainder 3, which is odd). Here, r = 3 Since we cannot answer the target question with certainty, statement 1 is NOT SUFFICIENT
Statement 2: When n is divided by 28, the remainder is 3 Possible values of n: 3, 31, 59, 87, . . . We can see that for all possible values of n, the remainder is always 3 when n is divided by 7 Since we can answer the target question with certainty, statement 2 is SUFFICIENT
Answer: B
RELATED VIDEO FROM OUR COURSE
how statement 2 is sufficient?
when 69/28 remainder is =3; when 69/7 remainder =6 when 87/28 r=3 ; when 87/7 r=3
Re: If r is the remainder when integer n is divided by 7, what is the valu
[#permalink]
16 Jun 2019, 09:50
Expert Reply
SUNILAA wrote:
how statement 2 is sufficient?
when 69/28 remainder is =3; when 69/7 remainder =6 when 87/28 r=3 ; when 87/7 r=3
You do not get a remainder of 3 when you divide 69 by 28.
If Statement 2 is true, then n is 3 larger than a multiple of 28. But every multiple of 28 is a multiple of 7 too, so that means n is 3 larger than a multiple of 7. That's another way of saying "the remainder is 3 when you divide n by 7", so Statement 2 is sufficient. _________________
GMAT Tutor in Montreal
If you are looking for online GMAT math tutoring, or if you are interested in buying my advanced Quant books and problem sets, please contact me at ianstewartgmat at gmail.com
Re: If r is the remainder when the positive integer n is divided by 7 what
[#permalink]
08 Jul 2020, 03:41
Bunuel wrote:
If r is the remainder when the postive integer n is divided by 7, what is the value of r ?
Positive integer \(a\) divided by positive integer \(d\) yields a reminder of \(r\) can always be expressed as \(a=qd+r\), where \(q\) is called a quotient and \(r\) is called a remainder, note here that \(0\leq{r}<d\) (remainder is non-negative integer and always less than divisor).
(1) when n is divided by 21 the remainder is an odd number --> \(n=21q+odd=7*3q+odd\), now as \(21q\) is itself divisible by 7 then if \(odd=1\) then \(n\) divided by 7 will yield the same reminder of 1 BUT if \(odd=3\) then \(n\) divided by 7 will yield the same reminder of 3. Two different answers, hence not sufficient.
Or try two different numbers for \(n\): If \(n=22\) then \(n\) divided by 21 gives remainder of 1 and \(n\) divded by 7 also gives remainder of 1; If \(n=24\) then \(n\) divided by 21 gives remainder of 3 and \(n\) divded by 7 also gives remainder of 3. Two different answers, hence not sufficient.
(2) when n is divided by 28, the remainder is 3 --> \(n=28p+3=7*(4p)+3\), now as \(28p\) is itself divisible by 7, then \(n\) divided by 7 will give remainder of 3. Sufficient.
Answer: B.
Bunuel what would have been the case in (2) if the numbers were not divisible by 7. Eg: 36p + 3
Thanks in advance ?
gmatclubot
Re: If r is the remainder when the positive integer n is divided by 7 what [#permalink]
One of the fastest-growing graduate business schools in Southern California, shaping the future by developing leading thinkers who will stand at the forefront of business growth. MBA Landing | School of Business (ucr.edu)