BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

DS

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Master | Next Rank: 500 Posts
Posts: 484
Joined: Sun Jul 30, 2006 7:01 pmFollowed by: 1 member
Thanked: 2 times
by magical cook » Thu Nov 29, 2007 10:45 pm
What is the remainder when the positive integer n is divided by 3?
(1) The remainder when n is divided by 2 is 1.
(2) The remainder when n + 1 is divided by 3 is 2.


I dont have answer..so hope someone could help me with this. thanks
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Data Sufficiency |
Master | Next Rank: 500 Posts
Posts: 460
Joined: Sun Mar 25, 2007 7:42 am
Thanked: 27 times

by samirpandeyit62 » Thu Nov 29, 2007 11:00 pm
What is the remainder when the positive integer n is divided by 3?
(1) The remainder when n is divided by 2 is 1.

n is odd, some odd nos are evenly divisble by 3, some are not INSUFF

(2) The remainder when n + 1 is divided by 3 is 2.

n+1 = 3a +2

n =3a +1

so remainder is 1

SUFF

B
Regards
Samir
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Master | Next Rank: 500 Posts
Posts: 214
Joined: Wed Nov 14, 2007 6:30 am
Thanked: 15 times

by sujaysolanki » Thu Nov 29, 2007 11:03 pm
From 1 n = 1 3 5 7 9

n/3 varies hence insufficient

From 2

n = 1,4,7,10 Hence sufficient

Hence B
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Master | Next Rank: 500 Posts
Posts: 484
Joined: Sun Jul 30, 2006 7:01 pmFollowed by: 1 member
Thanked: 2 times

by magical cook » Fri Nov 30, 2007 10:11 am
thank you!
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 941
Joined: Sun Dec 27, 2009 12:28 amFollowed by: 1 member
Thanked: 20 times

by bhumika.k.shah » Fri Jan 22, 2010 11:07 am
Is this a right approach though?

I aint denying that i used the same approach but in statement I we are getting many solutions and hence insufficient.
Likewise in Statement II ; however the answer is B

I did have a doubt in my mind but just chose B and went onto the next question...
sujaysolanki wrote:From 1 n = 1 3 5 7 9

n/3 varies hence insufficient

From 2

n = 1,4,7,10 Hence sufficient

Hence B
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Community Manager
Posts: 1537
Joined: Mon Aug 10, 2009 6:10 pmFollowed by: 252 members
Thanked: 653 times

by papgust » Sat Jan 23, 2010 6:49 am
Yeah that approach is right. You could either solve this by plugging in values (similar to that approach) or by setting up equations as samir has done.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Newbie | Next Rank: 10 Posts
Posts: 3
Joined: Mon Nov 07, 2011 11:15 pm
Thanked: 1 times

by Vena » Sat Nov 12, 2011 6:20 am
Consider stmt(1):The remainder when n is divided by 2 is 1.
n= 2K+1
where K is the quotient and 1 is the remainder
n/3 = (2K+1)/3
Take some examples:
K=2 -->(2K+1)/3 = 5/3, the remainder is 2
K=3 -->(2K+1)/3 = 7/3, the remainder is 1
There is no definite value for the remainder of n/3 --> stmt(1) is INSUFF

Consider stmt(2): The remainder when n + 1 is divided by 3 is 2.
(n+1)=3K+2
n= 3K+1
for every value of K, the remainder of (n+1)/3 is always 1
stmt(2) is SUFF
Choose B
Last edited by Vena on Sat Nov 12, 2011 6:22 pm, edited 1 time in total.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Senior | Next Rank: 100 Posts
Posts: 42
Joined: Sat Oct 01, 2011 7:26 amFollowed by: 5 members
Location: Madison, WI
Thanked: 23 times
GMAT Score:770

by Luke.Doolittle » Sat Nov 12, 2011 7:33 am
bhumika.k.shah wrote:Is this a right approach though?

I aint denying that i used the same approach but in statement I we are getting many solutions and hence insufficient.
Likewise in Statement II ; however the answer is B
You could also look at (1) from a purely equational point of view (is equational a word?)

From the statement
n = 2k + 1
n = 2k + k + 1 - k
n = 3k + (1-k)

r = 1-k

Which is not a constant (varies with the quotient) and since you don't have a single value for r this is insufficient
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1