It is currently 19 Nov 2017, 03:22

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

What is the remainder when the positive integer x is divided

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

1 KUDOS received
Intern
Intern
avatar
Joined: 20 Oct 2010
Posts: 6

Kudos [?]: 22 [1], given: 0

What is the remainder when the positive integer x is divided [#permalink]

Show Tags

New post 28 Oct 2010, 21:16
1
This post received
KUDOS
3
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

  35% (medium)

Question Stats:

70% (01:09) correct 30% (01:24) wrong based on 149 sessions

HideShow timer Statistics

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.
[Reveal] Spoiler: OA

Kudos [?]: 22 [1], given: 0

Manager
Manager
avatar
Joined: 25 Aug 2010
Posts: 91

Kudos [?]: 4 [0], given: 1

Re: problem from GMAT software practice test [#permalink]

Show Tags

New post 28 Oct 2010, 22:02
mybudgie wrote:
What is the best way to approach this problem? I would appreciate some help.

What is the remainder when the positive integer x is divided by 6?

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

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



From 1... when x is devided by 3 the reminder is zero ..so it has to be multiple of 3p
and the reminder is 1 when devided by 2 so it has to be odd.. 2(p) + 1
so when x is devided by 6 .. the reminder will be 1 ( when x is devisible of 6 when
x is devisible of 2 and 3 both )


so 1 is suffi...
Statement 2: When x is divided by 12, the remainder is 3
from when x is devided by 12 ...it has to be with 6 also...but when it carries a reminder when devided by 12... we have to think ...
since the reminder we get here < 6... it has to be the same reminder when devide with the 6 also ... so the reminder will be 3 only...
stmt 2 also suffi

so the ans : D

Kudos [?]: 4 [0], given: 1

Retired Moderator
User avatar
Joined: 02 Sep 2010
Posts: 793

Kudos [?]: 1208 [0], given: 25

Location: London
GMAT ToolKit User Reviews Badge
Re: problem from GMAT software practice test [#permalink]

Show Tags

New post 29 Oct 2010, 00:38
mybudgie wrote:
What is the best way to approach this problem? I would appreciate some help.

What is the remainder when the positive integer x is divided by 6?

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

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


(1) This says that x is a multiple of 3 but not a multiple of 2.
All even multiples of 3 must be divisible by 6, and all odd multiples must be of the form 6n+3. (this is easy to see, consider the multiples - 3,6,9,12,15,18,21,... - they are alternatively even and odd, the even ones are multiples of 6 and the others sit in the middle of two multiples, hence leave remainder 3 each time divided by 6).
Sufficient

(2) x = 12k + 3 = 6(2k) + 3
Hence remainder when divided by 6 is 3
Sufficient

Answer is (d)

_________________

Math write-ups
1) Algebra-101 2) Sequences 3) Set combinatorics 4) 3-D geometry

My GMAT story

GMAT Club Premium Membership - big benefits and savings

Kudos [?]: 1208 [0], given: 25

Expert Post
1 KUDOS received
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 42249

Kudos [?]: 132650 [1], given: 12329

Re: problem from GMAT software practice test [#permalink]

Show Tags

New post 29 Oct 2010, 03:48
1
This post received
KUDOS
Expert's post
1
This post was
BOOKMARKED
mybudgie wrote:
What is the best way to approach this problem? I would appreciate some help.

What is the remainder when the positive integer x is divided by 6?

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

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


This question can be very easily solved with number picking:

(1) When x is divided by 2, the remainder is 1 --> x is an odd number AND when x is divided by 3, the remainder is 0 --> x is a multiple of 3 --> so, x is an odd multiple of 3: 3, 9, 15, ... --> any such number divided by 6 yields remainder of 3. Sufficient.

(2) When x is divided by 12, the remainder is 3 --> x is of a type \(x=12q+3\): 3, 15, 27, ... --> any such number divided by 6 yields remainder of 3. Sufficient.

Answer: D.
_________________

New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | All You Need for Quant | PLEASE READ AND FOLLOW: 12 Rules for Posting!!!

Resources:
GMAT Math Book | Triangles | Polygons | Coordinate Geometry | Factorials | Circles | Number Theory | Remainders; 8. Overlapping Sets | PDF of Math Book; 10. Remainders | GMAT Prep Software Analysis | SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) | Tricky questions from previous years.

Collection of Questions:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
Extra-hard Quant Tests with Brilliant Analytics

Kudos [?]: 132650 [1], given: 12329

Expert Post
Veritas Prep GMAT Instructor
User avatar
G
Joined: 16 Oct 2010
Posts: 7736

Kudos [?]: 17790 [0], given: 235

Location: Pune, India
Re: problem from GMAT software practice test [#permalink]

Show Tags

New post 25 Apr 2011, 18:37
For a discussion on why statement 2 is obviously sufficient, check out the following post:
http://www.veritasprep.com/blog/2011/04 ... unraveled/
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Get started with Veritas Prep GMAT On Demand for $199

Veritas Prep Reviews

Kudos [?]: 17790 [0], given: 235

VP
VP
avatar
Status: There is always something new !!
Affiliations: PMI,QAI Global,eXampleCG
Joined: 08 May 2009
Posts: 1283

Kudos [?]: 286 [0], given: 10

Re: problem from GMAT software practice test [#permalink]

Show Tags

New post 25 Apr 2011, 21:25
a - multiples of 3 such as 3,9,15.Each giving remainder 3.
b- 12 is a multiple of 6,giving remainder 3. Implies dividing the same number by 6 will give the remainder 3.

Hence OA D.

Kudos [?]: 286 [0], given: 10

Expert Post
Veritas Prep GMAT Instructor
User avatar
G
Joined: 16 Oct 2010
Posts: 7736

Kudos [?]: 17790 [0], given: 235

Location: Pune, India
Re: problem from GMAT software practice test [#permalink]

Show Tags

New post 26 Apr 2011, 04:47
thangduong wrote:
picking number is the fastest one. using argument is not good though MORE PROFESSIONAL.

odd number which is divided by 3 is (2n+1)3, (2n+2)3 is not possible. (2n+1)3 = 6n +3 have remainder of 3


Mind you, picking numbers as a general strategy is not fool proof. Logic is. Pick numbers either as a last resort, or to get a drift of the question or when you are certain that a couple of examples will cover every scenario possible.
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Get started with Veritas Prep GMAT On Demand for $199

Veritas Prep Reviews

Kudos [?]: 17790 [0], given: 235

Manager
Manager
User avatar
Joined: 26 Jul 2010
Posts: 102

Kudos [?]: 32 [0], given: 6

Location: India
Concentration: Operations, General Management
Schools: IIMA (M)
GMAT 1: 640 Q48 V29
GMAT 2: 670 Q49 V31
WE: Supply Chain Management (Military & Defense)
Re: problem from GMAT software practice test [#permalink]

Show Tags

New post 30 Apr 2011, 18:10
best way is by picking nos in this case

st 1 suff
no divided by 3=== 3,6,9,12,15,18,21....
also div by 2 and remainder 1 ==== 3,9,15,21
so these no when divided by 6 will always give remainder 3

st 2
no will be 12n+3 ex 3, 15,27,39,51,...
so remainder will always be 3
sufficient

hence d
_________________

lets start again

Kudos [?]: 32 [0], given: 6

Intern
Intern
User avatar
Joined: 15 Dec 2009
Posts: 21

Kudos [?]: 8 [0], given: 14

Schools: Any offering one year MBA
WE 1: Information Tech
WE 2: Event Consultant for FIFA addi events and WC
Re: problem from GMAT software practice test [#permalink]

Show Tags

New post 16 Aug 2011, 10:58
Isnt the ans B.

First stmt: no divided by 3=== 3,6,9,12,15,18,21....
also div by 2 and remainder 1 ==== 3,9,15,21
but when 3/6 gives reminder '0' and others give reminder 3. so this stmt is insufficient.

Second Stmt:
no will be 12n+3 ex 3, 15,27,39,51,...
so remainder will always be 3
sufficient

Or am i missing something ??? Please let me know
_________________

K 4 KUDOS

Kudos [?]: 8 [0], given: 14

Math Forum Moderator
avatar
Joined: 20 Dec 2010
Posts: 1965

Kudos [?]: 2089 [0], given: 376

Re: problem from GMAT software practice test [#permalink]

Show Tags

New post 16 Aug 2011, 11:14
g4gmat wrote:
Isnt the ans B.

First stmt: no divided by 3=== 3,6,9,12,15,18,21....
also div by 2 and remainder 1 ==== 3,9,15,21
but when 3/6 gives reminder '0' and others give reminder 3. so this stmt is insufficient.

Second Stmt:
no will be 12n+3 ex 3, 15,27,39,51,...
so remainder will always be 3
sufficient

Or am i missing something ??? Please let me know


3/6 gives a remainder of 3 as well. The OA is D and is correct.
_________________

~fluke

GMAT Club Premium Membership - big benefits and savings

Kudos [?]: 2089 [0], given: 376

Non-Human User
User avatar
Joined: 09 Sep 2013
Posts: 15699

Kudos [?]: 282 [0], given: 0

Premium Member
Re: What is the remainder when the positive integer x is divided [#permalink]

Show Tags

New post 03 Oct 2017, 10:26
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.
_________________

GMAT Books | GMAT Club Tests | Best Prices on GMAT Courses | GMAT Mobile App | Math Resources | Verbal Resources

Kudos [?]: 282 [0], given: 0

Re: What is the remainder when the positive integer x is divided   [#permalink] 03 Oct 2017, 10:26
Display posts from previous: Sort by

What is the remainder when the positive integer x is divided

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

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

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.