![]() |
| If x is an integer, then x(x 1)(x k) must |
| Re: If x is an integer, then x(x 1)(x k) must |
|
Ron Purewal
MGMAT STAFF
|
note: in the following text, 'mo3' stands for 'multiple of three'. (i'm a lazy typist) here's one approach: first, realize that, if either x or (x - 1) is a mo3, then there is nothing to prove. so you need to assume that neither of those two numbers is a mo3, so that you actually have something to find. fact: every third number is a mo3. so, if x and (x - 1) are not mo3's, then all the red numbers in the following sequence must be mo3's: (...) x - 5 x - 4 x - 3 x - 2 x - 1 x x + 1 x + 2 x + 3 x + 4 x + 5 x + 6 x + 7 (...) all of the choices are red except for b. (note the added twist from the fact that it's x minus k, so you have to reverse the signs of the answers to correlate them to the list above) -- you are right on with the last comment, though. if you look at choices a, c, d, and e, they are all marching in lockstep, each one 3 greater than the previous one - until choice b comes along and spoils the party for everyone. |
||||||||||||||
|
|
|||||||||||||||
| If x is an integer, then x(x 1)(x k) must |
|
||
|
Powered by phpBB © phpBB Group
Content © Manhattan GMAT Forums
*GMAT and GMAT CAT are registered trademarks of the Graduate Management Admission Council,
which neither sponsors nor endorses this test preparation service.
Content © Manhattan GMAT Forums
*GMAT and GMAT CAT are registered trademarks of the Graduate Management Admission Council,
which neither sponsors nor endorses this test preparation service.

