by: JatinAswani
22 mins
by: ARINGO
23 mins
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.
Sep 0410:00 AM PDT
-11:00 AM PDT
What does test anxiety really look like on the GMAT? For many test takers, it does not look like a panic attack. Instead, it shows up as brain fog, rereading, negative comparisons, mental noise....
Sep 0201:00 PM EDT
-11:59 PM EDT
Take 30% off all study plans with code COURSEWORK - Expires on Monday 9/7
Sep 0609:30 AM EDT
-12:30 PM EST
Top scores are possible when you enroll in a powerful EA course, taught live online + 6 months access to TTP OnDemand video courses included! Perfect class schedule and easy course access for working professionals. Class starts Sundays Sept. 6, 2026.- Sep 07
12:01 AM PDT
-11:59 PM PDT
On the 7th, GMAT Club Tests will be Free! Including all the Quizzes, Questions, and Tests. 12 AM - 11:59 PM PDT - Sep 07
10:00 AM PDT
-11:00 AM PDT
A complete walkthrough of GMAT Club’s free 12-week GMAT study plan: what you study each week, how progress and goals are tracked, how the error log works, and how your practice unlocks paid tools at no cost. - Sep 09
07:00 AM PDT
-10:00 AM PDT
Meet AdComs and explore top Master’s programs - MiM, MiF, MSc, MSBA and more. - Application Fee Waivers - Free 1-Week of GMAT Club Tests: - Master's Application Toolkit - Grand Prize Giveaway - Sep 09
10:00 AM PDT
-11:00 AM PDT
Three MBA applications. Three rejections. No interview invites. A year later, Aman was admitted to Cambridge Judge, SMU, and IMD. In this episode of MBA Admit Stories, Aman shares how he rebuilt his MBA application... 
Sep 1507:00 PM EDT
-09:00 PM EST
Elite scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included! Class starts Tues/Thurs Sept. 15, 2026 - Nov. 15, 2027, 7:00pm-9:00pm EST
Sep 2108:00 PM EDT
-10:00 PM EDT
Boost your GMAT score in less than one month in a live online class + 6 months access to TTP OnDemand video courses included! Class starts Mon, Tues, Wed, Thur, Fri Sept. 21, 2026 - Oct. 9, 2027, 7:00pm-10:00pm EST
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
25%
(medium)
Question Stats:
76% (01:58) correct
24%
(02:22)
wrong
based on 2617
sessions
History
Date
Time
Result
Not Attempted Yet
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.
(1) n + 1 is divisible by 3
(2) n > 20.
Every tricky question should trigger a follow up quiz.
Build that habit with
GMAT Club Forum Quiz →.
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.
_________________
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.
_________________
New to the GMAT Club?
- • Questions: Question Bank | Bunuel's Signature Collection
• Tests: GMAT Club Tests | Forum Quiz
• Guides: Quantitative | Critical Reasoning | Reading Comprehension | Ultimate Quant Guide | All You Need for Quant
• Rules: Quantitative | Verbal
Michmax3
7n+4=3(2n+1) + n+1
So remainder when divided by 3 will be same as remainder left by n+1
1) sufficient ... Gives the answer
2) insufficient ... Irrelevant. Eg n= 22,23,24 all are possible
Answer is (a)
_________________
General Discussion
Posts: 722
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
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
omarjmh
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.
_________________
New to the GMAT Club?
- • Questions: Question Bank | Bunuel's Signature Collection
• Tests: GMAT Club Tests | Forum Quiz
• Guides: Quantitative | Critical Reasoning | Reading Comprehension | Ultimate Quant Guide | All You Need for Quant
• Rules: Quantitative | Verbal
shrouded1
Can you explain how you get to 7n+4=3(2n+1)?
ezhilkumarank
Joined: 24 Jun 2010
Last visit: 08 May 2014
Posts: 270
Status:Time to step up the tempo
Location: Milky way
Schools:ISB, Tepper - CMU, Chicago Booth, LSB
Posts: 270
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.
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.
Michmax3
Just trying to split it out into parts divisible by 3
7n becomes 6n+n
4 becomes 3+1
_________________
blueseas
Current Student
Joined: 14 Dec 2012
Last visit: 15 Jan 2019
Posts: 571
Location: India
Concentration: General Management, Operations
Schools: PGDM (GM) '15 (A)
GMAT 1: 700 Q50 V34
GPA: 3.6
forgmat
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
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!
(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!
vaishnogmat
Joined: 10 Jul 2012
Last visit: 27 Oct 2014
Posts: 10
Status:Finance Analyst
Affiliations: CPA Australia
Location: Australia
Concentration: Finance, Healthcare
Schools: AGSM '16 (A$)
GMAT 1: 470 Q38 V19
GMAT 2: 600 Q44 V34
GPA: 3.5
WE:Accounting (Healthcare/Pharmaceuticals)
Bunuel
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.
vaishnogmat
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.
_________________
New to the GMAT Club?
- • Questions: Question Bank | Bunuel's Signature Collection
• Tests: GMAT Club Tests | Forum Quiz
• Guides: Quantitative | Critical Reasoning | Reading Comprehension | Ultimate Quant Guide | All You Need for Quant
• Rules: Quantitative | Verbal
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.
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.
MariaAntony
Joined: 10 Mar 2019
Last visit: 13 Sep 2022
Posts: 20
Location: India
Schools: IMD Jan'23 intake
WE:Project Management (Computer Software)
Schools: IMD Jan'23 intake
Posts: 20
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.
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.
avigutman
Expert
Tutor
Joined: 17 Jul 2019
Last visit: 27 Jun 2026
Posts: 1,285
Location: Canada
Schools: NYU Stern (WA)
GMAT 1: 780 Q51 V45
GMAT 2: 780 Q50 V47
GMAT 3: 770 Q50 V45
Expert reply
Video solution from Quant Reasoning:
Subscribe for more: https://www.youtube.com/QuantReasoning? ... irmation=1
Subscribe for more: https://www.youtube.com/QuantReasoning? ... irmation=1
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
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
Kimberly77
Joined: 16 Nov 2021
Last visit: 07 Sep 2024
Posts: 418
Location: United Kingdom
GMAT 1: 450 Q42 V34
Products:
GMAT 1: 450 Q42 V34
Posts: 418
Bunuel
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\)
Kimberly77
- \(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.
_________________
New to the GMAT Club?
- • Questions: Question Bank | Bunuel's Signature Collection
• Tests: GMAT Club Tests | Forum Quiz
• Guides: Quantitative | Critical Reasoning | Reading Comprehension | Ultimate Quant Guide | All You Need for Quant
• Rules: Quantitative | Verbal
Kimberly77
Joined: 16 Nov 2021
Last visit: 07 Sep 2024
Posts: 418
Location: United Kingdom
GMAT 1: 450 Q42 V34
Products:
GMAT 1: 450 Q42 V34
Posts: 418
Bunuel
Ah get it thanks Bunuel
, I need to remember to use factoring.Thanks once again for your great help always !!
Engineer1
Joined: 01 Jan 2014
Last visit: 29 Jun 2026
Posts: 193
Location: United States
Concentration: Strategy, Finance
Schools: Booth (Chicago) (M$)
Schools: Booth (Chicago) (M$)
Posts: 193
Bunuel
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.
Moderators:
Announcements
Tuck at Dartmouth
AI at Dartmouth Tuck: How the School Is Preparing Leaders for the Age of Artificial Intelligence
Inside the courses, research, and hands-on learning defining wise, decisive leadership in an AI-driven world.
Read More
Inside the courses, research, and hands-on learning defining wise, decisive leadership in an AI-driven world.
Read More
Top 5 GMAT Debrief Videos
Success stories and strategies from high-scoring candidates.