need assistance understanding OG 12th, pg 288, question 170!

This topic has expert replies
Master | Next Rank: 500 Posts
Posts: 131
Joined: Fri Jun 18, 2010 10:19 am
Location: New York, NY
Thanked: 10 times
If n is a positive integer, is n^3 - n divisible by 4?

I. n = 2k + 1, where k is an integer.
II. n2 + n is divisible by 6.

My answer was E. But the OG answer is A, and I'm confused about this. The question says n is a positive integer, but that k is simply an integer. So if k = 1, then you have a set of consecutive integers 2, 3, 4. If k = 2, then you have set 8, 9, 10. In any case, playing with greater numbers this is sufficient. But what if k = 0. Then you end up with 0, 1, 2. And that is not sufficient.

Although n is a positive integer, k is merely an integer (nonetheless, an integer that leaves us with a positive n.

Was this just a mistake in the OG or am I missing a crucial concept?

Thanks for your help!
Source: — Data Sufficiency |

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 1179
Joined: Sun Apr 11, 2010 9:07 pm
Location: Milpitas, CA
Thanked: 447 times
Followed by:88 members

by Rahul@gurome » Sun Jul 11, 2010 6:58 pm
n^3 - n = n*(n^2-1) = n*(n+1)(n-1)
Consider I alone first.
If n = 2k+1, then n^3 - n = n*(n^2-1) = n*(n+1)(n-1)
= (2k+1)*(2k+2)*(2k) = 4*(k)*(k+1)(2k+1).
Since 4*(k)*(k+1)(2k+1) is a multiple of 4, n^3 - n is always divisible by 4.

Note: 0 is divisible by every other integer apart from 0 itself and in this case it is not defined.

So I alone is sufficient.

Consider II alone .
It says n^2+n is divisible by 6.
So n*(n+1) is divisible by 6.
Now take n = 6.
n^2+n is 42 is divisible by 6 but not by 4.
Next take n = 12. Here n^2+n is 156 which is divisible by both 6 and 4.

Since nothing definite can be said from II alone, it is not sufficient.

The correct answer is hence (A).
Rahul Lakhani
Quant Expert
Gurome, Inc.
https://www.GuroMe.com
On MBA sabbatical (at ISB) for 2011-12 - will stay active as time permits
1-800-566-4043 (USA)
+91-99201 32411 (India)