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

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Gmat prep

Expert replies
by sandranjeim » Mon Apr 26, 2010 9:09 am
What is the remainder when the positive integer x is divided by 6?

1) When x is divided by 2, the remainder is 1; and when x is divided by 3, the remainder is 0.

2) When x is divided by 12, the remainder is 3.


OA D
Join the discussion
Source: — Data Sufficiency |

by iamseer » Mon Apr 26, 2010 11:30 am
From 1:

X=2n+1 and X=3m, where m and n are integers. So basically X takes values which are odd multiples of 3 e.g. 3,9,15 etc
when divided by 6 remainder is always 3
SUFFICIENT

FROM 2:
X=12n+3 So basically X take values like 15, 27 etc (12n is always divisible by 6 leaving 3 as remainder)
when divided by 6 remainder is always 3
SUFFICIENT

IMO answer D
"Choose to chance the rapids and dance the tides"
Join the discussion

by tanviet » Tue Apr 27, 2010 4:16 am
How do you know (1) is sufficient?

only by plugging specific numbers?
Join the discussion

by liferocks » Tue Apr 27, 2010 4:32 am
duongthang wrote:How do you know (1) is sufficient?

only by plugging specific numbers?
from 1 we get x=3(2n+1) where n is any integer
or x=6n+3..so when x is divided by 6 reminder is 3
Join the discussion

by tpr-becky » Tue Apr 27, 2010 3:35 pm
if the remainder is 1 when divided by 2 then we know that x is odd - becuase when you divide by 2 you either get a remainder of 0 (for an even number) or a remainder of 1 (for an odd number) so the first part says that x is odd. If the remainder is 0 when divided by three that means that the number is divisible by three. So stmt 1 says that x is an odd multiple of three - odd multiples of three are 6 numbers apart which means they will all have the same remainder when divided by 6 (incidentally it is 3 in this case)

AD

Stmt 2 says that x is three more than a multiple of 12 - therefore it is also 3 more than a multiple of 6 (because 12 is a multiple of 6) Therefore sufficient.

D.
Becky
Master GMAT Instructor
The Princeton Review
Irvine, CA
Join the discussion

by tanviet » Tue Apr 27, 2010 11:59 pm
liferocks wrote:
duongthang wrote:How do you know (1) is sufficient?

only by plugging specific numbers?
from 1 we get x=3(2n+1) where n is any integer
or x=6n+3..so when x is divided by 6 reminder is 3
from (1) you can not have x=3(2n+1)

from (1) you can have x=3m(2n+1)= 6mn+3m with m is odd

so when x is divided by 6, remainder is 3m-with m is odd

so 3m=3.(2a+1)=6a+3

only now you can say that remainder is 3.


I see this problem is hard. and plugging number is ok. we should not solve above way.

any idea of this problem. pls, remember , we have only 2 minutes for this problem
Join the discussion

by MBA » Mon Sep 27, 2010 9:27 pm
tpr-becky wrote:if the remainder is 1 when divided by 2 then we know that x is odd - becuase when you divide by 2 you either get a remainder of 0 (for an even number) or a remainder of 1 (for an odd number) so the first part says that x is odd. If the remainder is 0 when divided by three that means that the number is divisible by three. So stmt 1 says that x is an odd multiple of three - odd multiples of three are 6 numbers apart which means they will all have the same remainder when divided by 6 (incidentally it is 3 in this case)

AD

Stmt 2 says that x is three more than a multiple of 12 - therefore it is also 3 more than a multiple of 6 (because 12 is a multiple of 6) Therefore sufficient.

D.
HI

If we consider the 1st statement i.e
"X=2n+1 and X=3m, where m and n are int ... always 3 "

We need to consider first X=3,in that case 3 divided by 6 gives a reminder different from ,the reminder whenX=9 is divded by 6.So how the statement 1 is sufficient.
Thanks.
Join the discussion