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: Divisible by 3 [#permalink]
31 Jan 2012, 15:17

11

This post received KUDOS

Expert's post

2

This post was BOOKMARKED

Hi, there. I'm happy to help with this.

The rule that the product of three consecutive integers is a good start, but not the be all and end all.

Think about it this way:

number = x(x – 1)(x – k)

So far, we have integer x and one less that it (x - 1), so we could go down one more, or up one from x --

k = 2 ----> x(x – 1)(x – 2)

k = -1 ----> x(x – 1)(x + 1)

Now, we don't know which of the three factors are divisible by 3 -- x, or (x - 1), or the (x - k). If it's either of the first two, then we're golden, and k doesn't matter. But pretend that neither x nor (x - 1) is divisible by 3, then we are dependent on that last factor. Well, if (x - 2) is a multiple of three, we should be able to add or subtract three and still get a multiple of three.

(x - 2) - 3 = (x - 5)

(x - 5) - 3 = (x - 8)

(x - 2) + 3 = (x + 1), which we have already

(x + 1) + 3 = (x + 4)

(x + 3) + 3 = (x + 7)

So, for divisibility purposes, (x - 8), (x - 5), (x - 2), (x + 1), (x + 4), (x + 7) are all equivalent -- if any one of them is a multiple of three, all the others are. (You can check that the difference between any two is a multiple of 3.) BTW, if they are not divisible by three, then they all would have equal remainders if divided by three.

Back to the question: If x is an integer, then x(x – 1)(x – k) must be evenly divisible by three when k is any of the following values EXCEPT A)-4 B)-2 C)-1 D) 2 E) 5

All of those choices give us a term on our list except for (B) -2.

BTW, notice all the answer choices are spaced apart by three except for (B).

Does that make sense? Please do not hesitate to ask if you have any questions.

Re: Divisible by 3 [#permalink]
31 Jan 2012, 15:06

8

This post received KUDOS

Expert's post

7

This post was BOOKMARKED

enigma123 wrote:

If x is an integer, then x(x – 1)(x – k) must be evenly divisible by three when k is any of the following values EXCEPT

A)-4 B)-2 C)-1 D) 2 E) 5

The OA is B. I am trying to use the concept of consecutive numbers but got stuck. Can someone please help?

Question says x(x – 1)(x – k) must be evenly divisible by three which means x(x-1) (x-k) should be consecutive.

We have the product of 3 integers: (x-1)x(x-k).

Note that the product of 3 integers is divisible by 3 if at least one multiple is divisible by 3. Now, to guarantee that at least one integer out of x, (x – 1), and (x – k) is divisible by 3 these numbers must have different remainders upon division by 3, meaning that one of them should have remainder of 1, another reminder of 2 and the last one remainder of 0, so be divisible by 3.

Next, if k=-2 then we'll have (x-1)x(x+2)=(x-1)x(x-1+3) --> which means that (x-1) and (x+2) will have the same remainder upon division by 3. Thus for k=-2 we won't be sure whether (x-1)x(x-k) is divisible by 3.

Answer: B.

30 second approach: 4 out of 5 values of k from answer choices must guarantee divisibility of some expression by 3. Now, these 4 values of k in answer choices must have some pattern: if we get rid of -2 then -4, -1, 2, and 5 creating arithmetic progression with common difference of 3, so -2 is clearly doesn't belong to this pattern.

Re: If x is an integer then x(x-1)(x-k) must be evenly divisible [#permalink]
04 Oct 2012, 22:10

5

This post received KUDOS

1

This post was BOOKMARKED

enigma123 wrote:

If x is an integer, then x(x – 1)(x – k) must be evenly divisible by three when k is any of the following values EXCEPT

A. -4 B. -2 C. -1 D. 2 E. 5

The OA is B. I am trying to use the concept of consecutive numbers but got stuck. Can someone please help?

Question says x(x – 1)(x – k) must be evenly divisible by three which means x(x-1) (x-k) should be consecutive.

Since this is a multiple choice GMAT question, you can pick a particular value for x such that neither x, nor x-1 is divisible by 3 and start checking the answers. In the given situation, choose for example x = 2 and check when 2 - k is not divisible by 3. (A) 2 - (-4) = 6 NO (B) 2 - (-2) = 4 BINGO!

Answer B. _________________

PhD in Applied Mathematics Love GMAT Quant questions and running.

Re: If x is an integer then x(x-1)(x-k) must be evenly divisible [#permalink]
27 Oct 2014, 05:45

4

This post received KUDOS

1

This post was BOOKMARKED

I tried the problem in a different way:

for any number to be divisible by 3, the sum of the integers in the number should be a factor of 3.

Taking the sum of x, (x-1) and (x-k) we have:

x+x-1+x-k = 3x-1-k

now looking at the choices

k = -4 => sum = 3x+3 --> divisible by 3 k = -2 => sum = 3x+1 --> not divisible by 3 k = -1 => sum = 3x --> divisible by 3 k = 2 => sum = 3x-3 --> divisible by 3 k = 5 ==> sum = 3x-6 --> divisible by 3

Re: If x is an integer then x(x-1)(x-k) must be evenly divisible [#permalink]
31 Jan 2012, 15:34

1

This post received KUDOS

This is my 1st post finally thought of jumping in instead of just being an observer I attacked this problem in a simple way. As it states it is divisible by 3 that means both x & (x-1) cannot be a multiple of 3 otherwise whatever the value of k it will be still divisible by 3 so plugging in number i chose 5 in this case you can establish answer is -2 does not fit...

Re: If x is an integer then x(x-1)(x-k) must be evenly divisible [#permalink]
17 Jun 2015, 04:49

1

This post received KUDOS

Expert's post

santorasantu wrote:

Quote:

If x is an integer, then x(x – 1)(x – k) must be evenly divisible by three when k is any of the following values EXCEPT

A. -4 B. -2 C. -1 D. 2 E. 5

I tried the problem in a different way:

for any number to be divisible by 3, the sum of the integers in the number should be a factor of 3.

Taking the sum of x, (x-1) and (x-k) we have:

x+x-1+x-k = 3x-1-k

now looking at the choices

k = -4 => sum = 3x+3 --> divisible by 3 k = -2 => sum = 3x+1 --> not divisible by 3 k = -1 => sum = 3x --> divisible by 3 k = 2 => sum = 3x-3 --> divisible by 3 k = 5 ==> sum = 3x-6 --> divisible by 3

so answer choice is (b)

Just refining the highlighted language and presenting another view to del with this problem

CONCEPT1:For any number to be divisible by 3, the sum of the Digits of the Number should be a Multiple of 3.

CONCEPT2: Product of any three consecutive Integers always include one muliple of 3 hence product of any three consecutive Integers is always a Multiple of 3

CONCEPT3: If a Number "w" is a Multiple of 3 then any number at a difference of 3 or multiple of 3 from "w" will also be a multiple of 3 i.e. If w is a multiple of 3 then (w+3), (w-3), (w+6), (w-6) etc. will all be Multiples of 3

Here, I see that x(x – 1) is a product of two consecutive Integers but if another Number next to them is obtained then x(x – 1)(x – k) will certainly be a multiple of 3 [as per Concept2 mentioned above]

for x(x – 1)(x – k) to be a product of 3 consecutive integers,

(x – k) should be either (x - 2) i.e. k=2 OR (x – k) should be either (x - 5) i.e. k=5 [Using Concept3] OR (x – k) should be either (x + 1) i.e. k=-1 OR (x – k) should be either (x + 4) i.e. k=-4 [Using Concept3]

Re: Divisible by 3 [#permalink]
04 Oct 2012, 17:59

Bunuel wrote:

enigma123 wrote:

If x is an integer, then x(x – 1)(x – k) must be evenly divisible by three when k is any of the following values EXCEPT

A)-4 B)-2 C)-1 D) 2 E) 5

The OA is B. I am trying to use the concept of consecutive numbers but got stuck. Can someone please help?

Question says x(x – 1)(x – k) must be evenly divisible by three which means x(x-1) (x-k) should be consecutive.

We have the product of 3 integers: (x-1)x(x-k).

Note that the product of 3 integers is divisible by 3 if at least one multiple is divisible by 3. Now, to guarantee that at least one integer out of x, (x – 1), and (x – k) is divisible by 3 these numbers must have different remainders upon division by 3, meaning that one of them should have remainder of 1, another reminder of 2 and the last one remainder of 0, so be divisible by 3.

Next, if k=-2 then we'll have (x-1)x(x+2)=(x-1)x(x-1+3) --> which means that (x-1) and (x+2) will have the same remainder upon division by 3. Thus for k=-2 we won't be sure whether (x-1)x(x-k) is divisible by 3.

Answer: B.

30 second approach: 4 out of 5 values of k from answer choices must guarantee divisibility of some expression by 3. Now, these 4 values of k in answer choices must have some pattern: if we get rid of -2 then -4, -1, 2, and 5 creating arithmetic progression with common difference of 3, so -2 is clearly doesn't belong to this pattern.

Hope it helps.

Bunuel,

Would this approach work for all integer divisors (NOT the 30 sec approach)? Say the divisor is 4 and the choices had four terms instead of three, e.g. (x-1)(x-2)(x+k)(x+1)?

Re: If x is an integer then x(x-1)(x-k) must be evenly divisible [#permalink]
05 Oct 2012, 02:56

Avantika5 wrote:

I too solved it using a value for x =2, but I am not sure if is it better to solve using value for such questions or otherwise.

On the GMAT, is definitely the fastest way to solve it. Being a multiple choice question, you can be sure that there is a unique correct answer. And in the given situation, the only issue is to choose for x values such that neither x, nor x - 1 is divisible by 3. It won't harm to understand and know to use the properties of consecutive integers presented in the other posts . They can be useful any time. _________________

PhD in Applied Mathematics Love GMAT Quant questions and running.

Re: If x is an integer then x(x-1)(x-k) must be evenly divisible [#permalink]
06 Oct 2012, 01:10

Avantika5 wrote:

Thanks EvaJager, I was always thought it is not good way to solve and I should learn the better way. Thanks a lot...

Better is a relative word...Mathematicians always try to prove and justify everything in a formal, logical way. But GMAT is not testing mathematical abilities per se. If they wanted so, the questions would have been open and not multiple choice. Have a flexible mind, think out of the box. GMAT is not a contest for the most beautiful, elegant, mathematical solution... Get the correct answer as quickly as possible, and go to the next question without any feeling of guilt...:O)

Though, as I said, try to understand the other properties of the integer numbers, they can become handy and also, because they are so beautiful! Isn't Mathematics wonderful? _________________

PhD in Applied Mathematics Love GMAT Quant questions and running.

Last edited by EvaJager on 06 Oct 2012, 01:46, edited 1 time in total.

Re: If x is an integer then x(x-1)(x-k) must be evenly divisible [#permalink]
06 Oct 2012, 01:25

1. k=-4, x+4=y so x=y-4. Now ----- (y-4)(y-5)(y). Gives number divisible by 3 in all cases. 2. k=-2, , x+2=y so x=y-2. Now ----- (y-2)(y-3)(y). Not applicable when y is 5 or when x is 7 3. k=-1, , x+1=y so x=y-1. Now ----- (y-1)(y-2)(y). Consecutive 3 integers. Divisible by 3 4. k=2, , x-2=y so x=y+2. Now ----- (y+2)(y+1)(y). Consecutive 3 integers. Divisible by 3 5. k=5, , x-5=y so x=y+5. Now ----- (y+5)(y+4)(y). Consecutive 3 integers. Divisible by 3 _________________

I will rather do nothing than be busy doing nothing - Zen saying

Re: Divisible by 3 [#permalink]
16 Feb 2013, 11:34

mikemcgarry wrote:

Hi, there. I'm happy to help with this.

The rule that the product of three consecutive integers is a good start, but not the be all and end all.

Think about it this way:

number = x(x – 1)(x – k)

So far, we have integer x and one less that it (x - 1), so we could go down one more, or up one from x --

k = 2 ----> x(x – 1)(x – 2)

k = -1 ----> x(x – 1)(x + 1)

Now, we don't know which of the three factors are divisible by 3 -- x, or (x - 1), or the (x - k). If it's either of the first two, then we're golden, and k doesn't matter. But pretend that neither x nor (x - 1) is divisible by 3, then we are dependent on that last factor. Well, if (x - 2) is a multiple of three, we should be able to add or subtract three and still get a multiple of three.

(x - 2) - 3 = (x - 5)

(x - 5) - 3 = (x - 8)

(x - 2) + 3 = (x + 1), which we have already

(x + 1) + 3 = (x + 4)

(x + 3) + 3 = (x + 7)

So, for divisibility purposes, (x - 8), (x - 5), (x - 2), (x + 1), (x + 4), (x + 7) are all equivalent -- if any one of them is a multiple of three, all the others are. (You can check that the difference between any two is a multiple of 3.) BTW, if they are not divisible by three, then they all would have equal remainders if divided by three.

Back to the question: If x is an integer, then x(x – 1)(x – k) must be evenly divisible by three when k is any of the following values EXCEPT A)-4 B)-2 C)-1 D) 2 E) 5

All of those choices give us a term on our list except for (B) -2.

BTW, notice all the answer choices are spaced apart by three except for (B).

Does that make sense? Please do not hesitate to ask if you have any questions.

Mike

Great posts everyone, including you Mike, who I am now quoting, but I would like to add that..

The first two integers for each answer choice cannot be divisible by 3 because all the answers choices would then be correct, thereby making the question invalid. Therefore, the last integer (x+k) must be divisible by 3, which helps in the theoretical approach...

Re: If x is an integer then x(x-1)(x-k) must be evenly divisible [#permalink]
17 Oct 2013, 14:25

enigma123 wrote:

If x is an integer, then x(x – 1)(x – k) must be evenly divisible by three when k is any of the following values EXCEPT

A. -4 B. -2 C. -1 D. 2 E. 5

The OA is B. I am trying to use the concept of consecutive numbers but got stuck. Can someone please help?

Question says x(x – 1)(x – k) must be evenly divisible by three which means x(x-1) (x-k) should be consecutive.

Hi enigma123. Thank you for the nice question. But you might wanna put a spoiler on this statement The OA is B so that others can solve the question in real conditions. Thanks

gmatclubot

Re: If x is an integer then x(x-1)(x-k) must be evenly divisible
[#permalink]
17 Oct 2013, 14:25

Low GPA MBA Acceptance Rate Analysis Many applicants worry about applying to business school if they have a low GPA. I analyzed the low GPA MBA acceptance rate at...

In out-of-the-way places of the heart, Where your thoughts never think to wander, This beginning has been quietly forming, Waiting until you were ready to emerge. For a long...