Last visit was: 26 Mar 2025, 11:51 It is currently 26 Mar 2025, 11:51
Close
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

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.
Close
Request Expert Reply
Confirm Cancel
User avatar
vigneshpandi
Joined: 23 Sep 2009
Last visit: 01 Jun 2011
Posts: 71
Own Kudos:
568
 [43]
Given Kudos: 37
Posts: 71
Kudos: 568
 [43]
5
Kudos
Add Kudos
37
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 26 March 2025
Posts: 100,090
Own Kudos:
Given Kudos: 92,710
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 100,090
Kudos: 711,092
 [12]
4
Kudos
Add Kudos
8
Bookmarks
Bookmark this Post
avatar
hunterdonald
Joined: 15 Oct 2014
Last visit: 12 Nov 2014
Posts: 4
Own Kudos:
13
 [7]
Posts: 4
Kudos: 13
 [7]
3
Kudos
Add Kudos
4
Bookmarks
Bookmark this Post
General Discussion
avatar
Keysersoze10
Joined: 04 Mar 2014
Last visit: 10 Nov 2018
Posts: 9
Given Kudos: 47
Concentration: Marketing, General Management
GMAT 1: 680 Q50 V32
GPA: 3.9
WE:Information Technology (Finance: Investment Banking)
Products:
GMAT 1: 680 Q50 V32
Posts: 9
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
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." ?
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 26 March 2025
Posts: 100,090
Own Kudos:
Given Kudos: 92,710
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 100,090
Kudos: 711,092
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Keysersoze10
Bunuel
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.
User avatar
0ld
Joined: 24 Aug 2016
Last visit: 09 Apr 2017
Posts: 48
Own Kudos:
79
 [3]
Given Kudos: 24
Location: India
WE:Information Technology (Computer Software)
Posts: 48
Kudos: 79
 [3]
2
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Quote:
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

\(\frac{n}{7} = q + r\)

(1) \(\frac{n}{21}\) = quotient + Some odd value

Minimum value of n could be 22 , 24 , 26 -- Not sufficient

(2) \(\frac{n}{28}\) = quotient + 3

Minimum value of n will be 31 that will satisfy above. So r = 3. --Sufficient

Ans. B
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 13 May 2024
Posts: 6,769
Own Kudos:
33,146
 [5]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,769
Kudos: 33,146
 [5]
1
Kudos
Add Kudos
4
Bookmarks
Bookmark this Post
Bunuel

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
avatar
SUNILAA
Joined: 09 Apr 2018
Last visit: 21 Nov 2021
Posts: 26
Own Kudos:
Given Kudos: 92
Location: India
Schools: IIMA PGPX"20
GPA: 3.5
Schools: IIMA PGPX"20
Posts: 26
Kudos: 6
Kudos
Add Kudos
Bookmarks
Bookmark this Post
GMATPrepNow
Bunuel

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
User avatar
IanStewart
User avatar
GMAT Tutor
Joined: 24 Jun 2008
Last visit: 26 Mar 2025
Posts: 4,132
Own Kudos:
Given Kudos: 97
 Q51  V47
Expert
Expert reply
Posts: 4,132
Kudos: 10,255
Kudos
Add Kudos
Bookmarks
Bookmark this Post
SUNILAA
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.
User avatar
Addu.23
Joined: 04 Jul 2017
Last visit: 24 Mar 2025
Posts: 18
Own Kudos:
Given Kudos: 98
Products:
Posts: 18
Kudos: 5
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
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 ?
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 36,711
Own Kudos:
Posts: 36,711
Kudos: 963
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
Moderator:
Math Expert
100090 posts