Last visit was: 24 Apr 2024, 08:17 It is currently 24 Apr 2024, 08:17

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
SORT BY:
Date
Tags:
Show Tags
Hide Tags
User avatar
Senior Manager
Senior Manager
Joined: 03 Sep 2006
Posts: 446
Own Kudos [?]: 6776 [196]
Given Kudos: 33
Send PM
Most Helpful Reply
Math Expert
Joined: 02 Sep 2009
Posts: 92902
Own Kudos [?]: 618752 [86]
Given Kudos: 81587
Send PM
User avatar
Retired Moderator
Joined: 02 Sep 2010
Posts: 615
Own Kudos [?]: 2930 [20]
Given Kudos: 25
Location: London
 Q51  V41
Send PM
General Discussion
avatar
Current Student
Joined: 07 May 2010
Posts: 722
Own Kudos [?]: 106 [11]
Given Kudos: 66
Send PM
Re: If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
9
Kudos
2
Bookmarks
i think i may have an easier way....
s1) 7n+4 = (6n+3)+(n+1)
if (n+1)/3 = an integer, so must 3 times (n+1)....which is (6n+3)
s2) Obviously NS
Math Expert
Joined: 02 Sep 2009
Posts: 92902
Own Kudos [?]: 618752 [17]
Given Kudos: 81587
Send PM
Re: If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
7
Kudos
10
Bookmarks
Expert Reply
omarjmh wrote:
i think i may have an easier way....
s1) 7n+4 = (6n+3)+(n+1)
if (n+1)/3 = an integer, so must 3 times (n+1)....which is (6n+3)
s2) Obviously NS


Little correction: 3 times (n+1) is 3n+3 not (6n+3).

But you are right, we can solve with this approach as well:

(1) n+1 is divisible by 3 --> \(7n+4=(4n+4)+3n=4(n+1)+3n\) --> \(4(n+1)\) is divisible by 3 as \(n+1\) is, and \(3n\) is obviously divisible by 3 as it has 3 as multiple, thus their sum, \(7n+4\), is also divisible by 3, which means that remainder upon division \(7n+4\) by 3 will be 0. Sufficient.

Hope it's clear.
User avatar
Senior Manager
Senior Manager
Joined: 14 Oct 2009
Status:Current Student
Posts: 353
Own Kudos [?]: 244 [0]
Given Kudos: 53
Concentration: CPG Marketing
Schools:Chicago Booth 2013, Ross, Duke , Kellogg , Stanford, Haas
 Q41  V42
GPA: 3.8
Send PM
Re: If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
shrouded1 wrote:
Michmax3 wrote:
7n+4=3(2n+1) + n+1

So remainder when divided by 3 will be same as remainder left by n+1



Can you explain how you get to 7n+4=3(2n+1)?
User avatar
Senior Manager
Senior Manager
Joined: 24 Jun 2010
Status:Time to step up the tempo
Posts: 273
Own Kudos [?]: 673 [4]
Given Kudos: 50
Location: Milky way
Concentration: International Business, Marketing
Schools:ISB, Tepper - CMU, Chicago Booth, LSB
Send PM
Re: If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
1
Kudos
3
Bookmarks
The information in the statement A is used favorably to tweak the equation in the question.

Hence 7n+4 becomes 3(2n+1) + (n+1). Now since 3(2n+1) leaves a remainder 0 when divided by 3, the remainder of 7n+4 will be the same as the remainder of (n+1).

Since (n+1) is also given in option A to be divisible by 3, hence remainder 0. Statement A is sufficient.
User avatar
Retired Moderator
Joined: 02 Sep 2010
Posts: 615
Own Kudos [?]: 2930 [1]
Given Kudos: 25
Location: London
 Q51  V41
Send PM
Re: If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
1
Kudos
Michmax3 wrote:
Can you explain how you get to 7n+4=3(2n+1)?


Just trying to split it out into parts divisible by 3
7n becomes 6n+n
4 becomes 3+1
User avatar
Current Student
Joined: 14 Dec 2012
Posts: 580
Own Kudos [?]: 4324 [7]
Given Kudos: 197
Location: India
Concentration: General Management, Operations
GMAT 1: 700 Q50 V34
GPA: 3.6
Send PM
Re: If n is a positive integer and r is the remainder when 4+7n [#permalink]
4
Kudos
3
Bookmarks
forgmat wrote:
If n is a positive integer and r is the remainder when 4+7n is divided by 3 what is the value of r ?

1) n+1 is divisible by 3
2) n >20


Please explain


statmnt 1:
n+1 ==>div by 3
therefore 7(n+1) ==>div. by 3
(7n+4)+3 ==>div by ===>this means 7n+4 is div by 3
sufficient

statement 2:
n>20
let n=30==>7n+4=214==>when divided by 3 remainder i s1
let n=40==>7n+4=284==>when divided by 3 remainder i s2
hence not sufficient

hence A
User avatar
Director
Director
Joined: 03 Aug 2012
Posts: 587
Own Kudos [?]: 3155 [3]
Given Kudos: 322
Concentration: General Management, General Management
GMAT 1: 630 Q47 V29
GMAT 2: 680 Q50 V32
GPA: 3.7
WE:Information Technology (Investment Banking)
Send PM
Re: If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
1
Kudos
2
Bookmarks
Q. What is r?

(1). (n+1) div by 3

By question stem we know that

4 + 7n = 3Q + r

Splitting the equation as below

4+4n+3n = 3Q + r

=> 3n + 4 (n+1) = 3Q + r

LHS is divisible by 3 as (n+1) is div by 3, so RHS should also be divisible by 3 hence r should be 0

(2).

4 + 7n = 3Q +r

Case 1: n=21

4 + 7*21 = 3Q +r

LHS gives 4 as remainder when divided by 3 so r=4

Case 2: n=22

4 + 7*22 = 3Q + r

No info about r, hence inconsistent

(A) it is!
User avatar
Intern
Intern
Joined: 10 Jul 2012
Status:Finance Analyst
Affiliations: CPA Australia
Posts: 10
Own Kudos [?]: 244 [0]
Given Kudos: 4
Location: Australia
Concentration: Finance, Healthcare
Schools: AGSM '16 (A$)
GMAT 1: 470 Q38 V19
GMAT 2: 600 Q44 V34
GPA: 3.5
WE:Accounting (Health Care)
Send PM
If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
Bunuel wrote:
LM wrote:
Please explain the answer......


If n is a positive integer, and r is the remainder when 4 + 7n is divided by 3, what is the value of r?

The condition "r is the remainder when 4 + 7n is divided by 3" can be expressed as \(4 + 7n = 3q + r\), where r is an integer such that \(0 \leq r < 3\). The question asks for the value of r.

(1) n + 1 is divisible by 3

This implies \(n + 1 = 3k\), or \(n = 3k - 1\). Substituting this value of n into the equation, we get \(4 + 7(3k - 1) = 3q + r\). Simplifying, this becomes \(3(7k - 1 - q) = r\). This means that r is a multiple of 3. However, since r is an integer within the range \(0 \leq r < 3\), the only possibility is r = 0. Sufficient.

(2) n > 20.

This is clearly not sufficient. For example, if \(n = 21\), then \(4 + 7n = 151\), resulting in \(r = 1\). However, if \(n = 22\), then \(4 + 7n = 158\), resulting in \(r = 2\).

Answer: A.



I am not sure if it has been asked/discussed before, but can we use the following approach:

re-write 4 + 7n as (3+1) + (6n + 1). now if we divide this by 3 we are left with (1) + (2n +1), which is essentially (2n + 2) ------> 2(n+1)/3 leaves no remainder or in other words 0 - using statement 1 information.

Please correct me if I this approach is incorrect.
Math Expert
Joined: 02 Sep 2009
Posts: 92902
Own Kudos [?]: 618752 [1]
Given Kudos: 81587
Send PM
If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
1
Bookmarks
Expert Reply
vaishnogmat wrote:
Bunuel wrote:
LM wrote:
Please explain the answer......


If n is a positive integer, and r is the remainder when 4 + 7n is divided by 3, what is the value of r?

The condition "r is the remainder when 4 + 7n is divided by 3" can be expressed as \(4 + 7n = 3q + r\), where r is an integer such that \(0 \leq r < 3\). The question asks for the value of r.

(1) n + 1 is divisible by 3

This implies \(n + 1 = 3k\), or \(n = 3k - 1\). Substituting this value of n into the equation, we get \(4 + 7(3k - 1) = 3q + r\). Simplifying, this becomes \(3(7k - 1 - q) = r\). This means that r is a multiple of 3. However, since r is an integer within the range \(0 \leq r < 3\), the only possibility is r = 0. Sufficient.

(2) n > 20.

This is clearly not sufficient. For example, if \(n = 21\), then \(4 + 7n = 151\), resulting in \(r = 1\). However, if \(n = 22\), then \(4 + 7n = 158\), resulting in \(r = 2\).

Answer: A.



I am not sure if it has been asked/discussed before, but can we use the following approach:

re-write 4 + 7n as (3+1) + (6n + 1). now if we divide this by 3 we are left with (1) + (2n +1), which is essentially (2n + 2) ------> 2(n+1)/3 leaves no remainder or in other words 0 - using statement 1 information.

Please correct me if I this approach is incorrect.


4 + 7n = (3+1) + (6n + n) not (3+1) + (6n + 1).

You can solve (1) in another way: \(4 + 7n = 4 + 4n + 3n = 4(n + 1) + 3n\). First statement says that \(n + 1\) is is divisible by 3, thus \(4(n + 1) + 3n = (a \ multiple \ of \ 3) + (a \ multiple \ of \ 3)\). Therefore \(4 + 7n\) yields the remainder of 0, when divided by 3.

Hope it helps.
Director
Director
Joined: 26 Oct 2016
Posts: 510
Own Kudos [?]: 3378 [9]
Given Kudos: 877
Location: United States
Concentration: Marketing, International Business
Schools: HBS '19
GMAT 1: 770 Q51 V44
GPA: 4
WE:Education (Education)
Send PM
Re: If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
6
Kudos
3
Bookmarks
1) n+1 is a multiple of 3.

If n=2 (we're allowed to pick 2 since 2+1 is a multiple of 3), then (4+14)/3 = 18/3 = 6rem0
If n=5 (we're allowed to pick 5 since 5+1 is a multiple of 3), then (4+35)/3 = 39/3 = 13rem0

at this point you might already be conviced that you'll always get the same answer, but we could try one more just to be safe:

If n=8 (we're allowed to pick 8 since 8+1 is a multiple of 3), then (4+56) = 60/3 = 20rem0

For all 3 plug-ins we get r=0.. sufficient!

2) n > 20

If n=21, then (4+147)/3 = 151/3 = 50rem1
Insuff.

Hence A.
Intern
Intern
Joined: 10 Mar 2019
Posts: 22
Own Kudos [?]: 4 [1]
Given Kudos: 296
Location: India
WE:Project Management (Computer Software)
Send PM
Re: If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
1
Bookmarks
Info from the stem:
1. N > 0 and integer
2. 7N + 4 when divided by 3 leaves a remainder R

7N + 4 can be re-written as 6N + 3 + (N + 1). 6N and 3 are divisible by 3 always, so we need to find what is the remainder when N+1 is divided by 3.

S1: N+1 is divisible by 3 - implies R=0 (unique answer). Sufficient.
S2: N > 20 - multiple answers are possible. Insufficient.

Hence the correct answer is option A.
Tutor
Joined: 17 Jul 2019
Posts: 1304
Own Kudos [?]: 2285 [1]
Given Kudos: 66
Location: Canada
GMAT 1: 780 Q51 V45
GMAT 2: 780 Q50 V47
GMAT 3: 770 Q50 V45
Send PM
Re: If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
1
Kudos
Expert Reply
Video solution from Quant Reasoning:
Subscribe for more: https://www.youtube.com/QuantReasoning? ... irmation=1
User avatar
Intern
Intern
Joined: 26 Feb 2023
Posts: 1
Own Kudos [?]: 0 [0]
Given Kudos: 1
Send PM
Re: If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
I'm thinking of the following approach. Please tell me if it's incorrect.

if r is the reminder when 4+7n is divided by 3 means r = 1(reminder of 4/3) + reminder of 7n/3
Now,
option-1 - if n+1 is divisible by 3, reminder of n when divided by 3 is 2. hence now r = 1 + 2 = 3 which is divisible by 3 and hence r =0. Sufficient.
However,
option-2 - says n > 20. This doesn't mean anything as it can have multiple values which may or may not be divisible by 3. In sufficient.

Answer - A
Senior Manager
Senior Manager
Joined: 16 Nov 2021
Posts: 476
Own Kudos [?]: 27 [0]
Given Kudos: 5900
Location: United Kingdom
Send PM
If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
Bunuel wrote:
If n is a positive integer, and r is the remainder when 4 + 7n is divided by 3, what is the value of r?

The condition "r is the remainder when 4 + 7n is divided by 3" can be expressed as \(4 + 7n = 3q + r\), where r is an integer such that \(0 \leq r < 3\). The question asks for the value of r.

(1) n + 1 is divisible by 3

This implies \(n + 1 = 3k\), or \(n = 3k - 1\). Substituting this value of n into the equation, we get \(4 + 7(3k - 1) = 3q + r\). Simplifying, this becomes \(3(7k - 1 - q) = r\). This means that r is a multiple of 3. However, since r is an integer within the range \(0 \leq r < 3\), the only possibility is r = 0. Sufficient.

(2) n > 20.

This is clearly not sufficient. For example, if \(n = 21\), then \(4 + 7n = 151\), resulting in \(r = 1\). However, if \(n = 22\), then \(4 + 7n = 158\), resulting in \(r = 2\).

Answer: A.


Good explanation Bunuel
One question not sure how you derive below? Could you elaborate please? Thanks

\(4+7(3k-1)=3q+r\) --> \(3(7k-1-q)=r\)
Math Expert
Joined: 02 Sep 2009
Posts: 92902
Own Kudos [?]: 618752 [0]
Given Kudos: 81587
Send PM
Re: If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
Expert Reply
Kimberly77 wrote:
Bunuel wrote:
If n is a positive integer, and r is the remainder when 4 + 7n is divided by 3, what is the value of r?

The condition "r is the remainder when 4 + 7n is divided by 3" can be expressed as \(4 + 7n = 3q + r\), where r is an integer such that \(0 \leq r < 3\). The question asks for the value of r.

(1) n + 1 is divisible by 3

This implies \(n + 1 = 3k\), or \(n = 3k - 1\). Substituting this value of n into the equation, we get \(4 + 7(3k - 1) = 3q + r\). Simplifying, this becomes \(3(7k - 1 - q) = r\). This means that r is a multiple of 3. However, since r is an integer within the range \(0 \leq r < 3\), the only possibility is r = 0. Sufficient.

(2) n > 20.

This is clearly not sufficient. For example, if \(n = 21\), then \(4 + 7n = 151\), resulting in \(r = 1\). However, if \(n = 22\), then \(4 + 7n = 158\), resulting in \(r = 2\).

Answer: A.


Good explanation Bunuel
One question not sure how you derive below? Could you elaborate please? Thanks

\(4+7(3k-1)=3q+r\) --> \(3(7k-1-q)=r\)


    \(4+7(3k-1)=3q+r\);

    \(4+21k-7=3q+r\);

    \(21k-3=3q+r\);

    \(21k-3-3q=r\);

    \(3(7k-1-q)=r\).

Hope this helps.
Senior Manager
Senior Manager
Joined: 16 Nov 2021
Posts: 476
Own Kudos [?]: 27 [0]
Given Kudos: 5900
Location: United Kingdom
Send PM
Re: If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
Bunuel wrote:
Kimberly77 wrote:
Bunuel wrote:
If n is a positive integer, and r is the remainder when 4 + 7n is divided by 3, what is the value of r?

The condition "r is the remainder when 4 + 7n is divided by 3" can be expressed as \(4 + 7n = 3q + r\), where r is an integer such that \(0 \leq r < 3\). The question asks for the value of r.

(1) n + 1 is divisible by 3

This implies \(n + 1 = 3k\), or \(n = 3k - 1\). Substituting this value of n into the equation, we get \(4 + 7(3k - 1) = 3q + r\). Simplifying, this becomes \(3(7k - 1 - q) = r\). This means that r is a multiple of 3. However, since r is an integer within the range \(0 \leq r < 3\), the only possibility is r = 0. Sufficient.

(2) n > 20.

This is clearly not sufficient. For example, if \(n = 21\), then \(4 + 7n = 151\), resulting in \(r = 1\). However, if \(n = 22\), then \(4 + 7n = 158\), resulting in \(r = 2\).

Answer: A.


Good explanation Bunuel
One question not sure how you derive below? Could you elaborate please? Thanks

\(4+7(3k-1)=3q+r\) --> \(3(7k-1-q)=r\)


    \(4+7(3k-1)=3q+r\);

    \(4+21k-7=3q+r\);

    \(21k-3=3q+r\);

    \(21k-3-3q=r\);

    \(3(7k-1-q)=r\).

Hope this helps.


Ah get it thanks Bunuel :please: , I need to remember to use factoring.
Thanks once again for your great help always !!
Manager
Manager
Joined: 01 Jan 2014
Posts: 204
Own Kudos [?]: 68 [0]
Given Kudos: 420
Location: United States (MI)
Send PM
If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
Bunuel wrote:
Kimberly77 wrote:
Bunuel wrote:
If n is a positive integer, and r is the remainder when 4 + 7n is divided by 3, what is the value of r?

The condition "r is the remainder when 4 + 7n is divided by 3" can be expressed as \(4 + 7n = 3q + r\), where r is an integer such that \(0 \leq r < 3\). The question asks for the value of r.

(1) n + 1 is divisible by 3

This implies \(n + 1 = 3k\), or \(n = 3k - 1\). Substituting this value of n into the equation, we get \(4 + 7(3k - 1) = 3q + r\). Simplifying, this becomes \(3(7k - 1 - q) = r\). This means that r is a multiple of 3. However, since r is an integer within the range \(0 \leq r < 3\), the only possibility is r = 0. Sufficient.

(2) n > 20.

This is clearly not sufficient. For example, if \(n = 21\), then \(4 + 7n = 151\), resulting in \(r = 1\). However, if \(n = 22\), then \(4 + 7n = 158\), resulting in \(r = 2\).

Answer: A.


Good explanation Bunuel
One question not sure how you derive below? Could you elaborate please? Thanks

\(4+7(3k-1)=3q+r\) --> \(3(7k-1-q)=r\)


    \(4+7(3k-1)=3q+r\);

    \(4+21k-7=3q+r\);

    \(21k-3=3q+r\);

    \(21k-3-3q=r\);

    \(3(7k-1-q)=r\).

Hope this helps.


Hi Bunuel. Is my method correct? Do we really need to use r in this solution? Thank you!

With statement 1, n+1 = 3K (since n+1 is divisible by 3)
Replacing value of n in the original number 7n+4 = n(3k-1)+4 = 21k - 3 = 3(7k-1), which is divisible by 3. Therefore, remainder is 0.
GMAT Club Bot
If n is a positive integer and r is the remainder when 4 + 7n is divid [#permalink]
Moderator:
Math Expert
92902 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne