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:

Does GMAT RC seem like an uphill battle? e-GMAT is conducting a free webinar to help you learn reading strategies that can enable you to solve 700+ level RC questions with at least 90% accuracy in less than 10 days.

Sign up or for Target Test Prep’s weekly Quant webinar series. The free weekly webinar covers sophisticated, yet easy-to-deploy, tactics and strategies for handling commonly misunderstood, high-value GMAT quant problems.

Enter The Economist GMAT Tutor’s Brightest Minds competition – it’s completely free! All you have to do is take our online GMAT simulation test and put your mind to the test. Are you ready? This competition closes on December 13th.

Re: If r is the remainder when integer n is divided by 7, what is the valu
[#permalink]

Show Tags

27 Oct 2014, 09:36

2

3

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]

Show Tags

21 Sep 2010, 22:12

4

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 the positive integer n is divided by 7 what
[#permalink]

Show Tags

03 Apr 2016, 14: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]

Show Tags

03 Apr 2016, 21:23

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]

Show Tags

20 Apr 2018, 07:36

Top Contributor

2

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]

Show Tags

16 Jun 2019, 01: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]

Show Tags

16 Jun 2019, 10:50

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 Toronto

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 intreger n is
[#permalink]

Show Tags

21 Oct 2019, 10:12

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________