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:

Always remember, when 3 consecutive integers are multiplied, then one should be a multiple of 3 and atleast one (or max 2) number is even. Also, if the multiple of 3 is also the even number like 6, 12, 18 then it is divisible by 6 always..

For ex:- 1*2*3 ; -4*-5*-6 ; 4*5*6 ; 11*12*13..

In any case; the product would be divisible by 6.

2.) insufficient.. does not say anything about n..

If n and k are positive integers, is n divisible by 6?

(1) n = k(k + 1)(k - 1) (2) k – 1 is a multiple of 3

Please explain your answer. Thanks

My answer would be A. Since n = product of 3 consecutive numbers, it will be divisible by 3. We should also remember that 0 is also a multiple of 6. For eg : if k = 1, n = 1*2*0 => n = 0 which IS divisible by 6.

I hope I am right. "0 is divisible by any number" right?
_________________

GMAT offended me. Now, its my turn! Will do anything for Kudos! Please feel free to give one.

If n and k are positive integers, is n divisible by 6?

(1) n = k(k + 1)(k - 1) (2) k – 1 is a multiple of 3

Please explain your answer. Thanks

My answer would be A. Since n = product of 3 consecutive numbers, it will be divisible by 3. We should also remember that 0 is also a multiple of 6. For eg : if k = 1, n = 1*2*0 => n = 0 which IS divisible by 6.

I hope I am right. "0 is divisible by any number" right?

I slightly differ on your explination......specially if k = 1...

If k = 1 then n = 0*1*2 then n = 0 ... zero is not a positive integer hence all values of k will start from 2 onwards hence values of n will start from 6 onwards.....but yes your ans is right A it is _________________

Bhushan S. If you like my post....Consider it for Kudos

If n and k are positive integers, is n divisible by 6?

(1) n = k(k + 1)(k - 1) (2) k – 1 is a multiple of 3

Please explain your answer. Thanks

My answer would be A. Since n = product of 3 consecutive numbers, it will be divisible by 3. We should also remember that 0 is also a multiple of 6. For eg : if k = 1, n = 1*2*0 => n = 0 which IS divisible by 6.

I hope I am right. "0 is divisible by any number" right?

I slightly differ on your explination......specially if k = 1...

If k = 1 then n = 0*1*2 then n = 0 ... zero is not a positive integer hence all values of k will start from 2 onwards hence values of n will start from 6 onwards.....but yes your ans is right A it is

Right. Now see the mistake. Thanks!
_________________

GMAT offended me. Now, its my turn! Will do anything for Kudos! Please feel free to give one.

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

Re: If n and k are positive integers, is n divisible by 6? [#permalink]

Show Tags

24 Apr 2015, 16:17

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

Re: If n and k are positive integers, is n divisible by 6? [#permalink]

Show Tags

23 May 2015, 02:54

1

This post was BOOKMARKED

tarek99 wrote:

If n and k are positive integers, is n divisible by 6?

(1) n = k(k + 1)(k - 1)

(2) k – 1 is a multiple of 3

Here's my way to solve this:

Statement (1): Rewrite n = k(k + 1)(k - 1) to: \(k^3-k\) and plug in various positive integers to see that the result will alsways be divisible by 3. Therefore AC 1 = Sufficient

Statement (2) Gives you just an idea about the term k-1, but nothing about k or k+1 itself. Therefore clearly insufficient.
_________________

Saving was yesterday, heat up the gmatclub.forum's sentiment by spending KUDOS!

PS Please send me PM if I do not respond to your question within 24 hours.

If n and k are positive integers, is n divisible by 6? [#permalink]

Show Tags

19 Sep 2015, 05:17

i dont understand why b is not sufficient, if k-1 is a multiple of 3, then k or k+1 should be a multiple of 2... and so, it should be sufficient as well.... am i missing something?
_________________

kinaare paaon phailane lage hian, nadi se roz mitti kat rahi hai....

i dont understand why b is not sufficient, if k-1 is a multiple of 3, then k or k+1 should be a multiple of 2... and so, it should be sufficient as well.... am i missing something?

You are correct to say that if k-1 =3p, then k or k+1 will be =2r. But what is the connection between k and n? You are using information from statement 1 to check for sufficiency of statement 2. This absolutely wrong. You need to isolate both statements completely to determine their respective sufficiency. Only once they are not sufficient ALONE, you go to combining the 2 statements.
_________________

If n and k are positive integers, is n divisible by 6?

(1) n = k(k + 1)(k - 1)

(2) k – 1 is a multiple of 3

Here's my way to solve this:

Statement (1): Rewrite n = k(k + 1)(k - 1) to: \(k^3-k\) and plug in various positive integers to see that the result will alsways be divisible by 3. Therefore AC 1 = Sufficient

Statement (2) Gives you just an idea about the term k-1, but nothing about k or k+1 itself. Therefore clearly insufficient.

reto, a couple of points about your solution (although you were able to get to the correct answer):

For statement 1, k(k-1)(k+1) will ALWAYS be divisible by 6. Think of this way. For any number to be divisible by 6, it needs to be divisible by BOTH 2 and 3 at the same time.

Consider 2 cases, if k =2p, then k+1 or k-1 MUST be disivible by 3. Thus the product k(k-1)(k+1) will always be divisible by 6.

Case 2: if k = 3p, then k-1 or k+1 MUST be divisble by 2. Thus the product k(k-1)(k+1) will always be divisible by 6.

As for your interpretation of statement 2, we do not need to even look at the statement and start computing numbers as the question stem asks us whether "n" is divisible by 6 and NOT whether "k" is divisible by 6. Statement 2 does not provide any relation between k and n and hence straightaway you can reject this statement.

Also you are incorrect to say that as k-1=3p, you have no information about k+1 or k. This is not correct. If k-1=3p., then 1 of k or k+1 MUST be divisible by 2 (you can check with some numbers). Thus you do get some actionable information (albeit not pertinent to the original question asked!).
_________________

Also you are incorrect to say that as k-1=3p, you have no information about k+1 or k. This is not correct. If k-1=3p., then 1 of k or k+1 MUST be divisible by 2 (you can check with some numbers). Thus you do get some actionable information (albeit not pertinent to the original question asked!).

Hi Engr2012, irrespective of what K-1 is, one of k or k+1 will always be divisible by 2 as k is a positive integer..
_________________

Also you are incorrect to say that as k-1=3p, you have no information about k+1 or k. This is not correct. If k-1=3p., then 1 of k or k+1 MUST be divisible by 2 (you can check with some numbers). Thus you do get some actionable information (albeit not pertinent to the original question asked!).

Hi Engr2012, irrespective of what K-1 is, one of k or k+1 will always be divisible by 2 as k is a positive integer..

Yes that is what I have written above. Additionally, the question asks about n and NOT k. Without any relation between n and k , this information is of no use.
_________________

Also you are incorrect to say that as k-1=3p, you have no information about k+1 or k. This is not correct. If k-1=3p., then 1 of k or k+1 MUST be divisible by 2 (you can check with some numbers). Thus you do get some actionable information (albeit not pertinent to the original question asked!).

Hi Engr2012, irrespective of what K-1 is, one of k or k+1 will always be divisible by 2 as k is a positive integer..

Yes but which one will it be ? Additionally, the question asks about n and NOT k. Without any relation between n and k , this information is of no use.

Hi, I am not questioning the solution. it is very clear and fairly simple... i am just pointing to the highlighted portion that it is not because k-1=3p that k or k+1 will be div by 2 but one of k or k+1 will always be div by 2... _________________

I just realized something while solving this question, please let me know if im correct on this one:

Product of n consecutive integers is always divisible by -all integers between 1 and n inclusive. -n! -all the factors of n!

Can we make this generalization??
_________________

One Kudos for an everlasting piece of knowledge is not a bad deal at all...

------------------------------------------------------------------------------------------------------------------------ Twenty years from now you will be more disappointed by the things you didn't do than by the ones you did do. So throw off the bowlines. Sail away from the safe harbor. Catch the trade winds in your sails. Explore. Dream. Discover. -Mark Twain

gmatclubot

Re: If n and k are positive integers, is n divisible by 6?
[#permalink]
09 Nov 2015, 08:21

Military MBA Acceptance Rate Analysis Transitioning from the military to MBA is a fairly popular path to follow. A little over 4% of MBA applications come from military veterans...

Best Schools for Young MBA Applicants Deciding when to start applying to business school can be a challenge. Salary increases dramatically after an MBA, but schools tend to prefer...

Marty Cagan is founding partner of the Silicon Valley Product Group, a consulting firm that helps companies with their product strategy. Prior to that he held product roles at...