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

PLEASE READ AND FOLLOW: 11 Rules for Posting!!!

RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory

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. NEW!!!

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. NEW!!!


What are GMAT Club Tests?
25 extra-hard Quant Tests

Find out what's new at GMAT Club - latest features and updates

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
_________________

Mike McGarry
Magoosh Test Prep

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

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)?

Thanks,

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.

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

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

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


Need help..............