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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

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

Show Tags

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

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

Show Tags

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

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.

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

Show Tags

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.

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.
_________________

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

Show Tags

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

WE 2: Event Consultant for FIFA addi events and WC

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

Show Tags

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
_________________

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

Show Tags

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.
_________________

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

Show Tags

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.
_________________