what's the problem Tomada, do you agree with the solution below as well as an answer to your query?
given: n (integer) >0, n(n+1)(n-1)/4
st(1) 2k=n-1 <-- integer Sufficient to answer Yes, because k is an integer and (n-1)/2 is an integer too. So n is odd and alone cannot be divided by 4 BUT one (odd+1)*(another odd-1) gives divisibility by 4. Even with n=1 and k=0 we have 0/4

st(2) n(n+1)/6 Obviously Not Sufficient.
Answer Yes and choice A.
[spoiler]If n is a positive integer, is n^3 - n divisible by 4?
1) n = 2k+1, where k is an integer.
2) n^2 + n is divisible by 6.
[/spoiler]
tomada wrote:What if k=0 ? Then, n = 2(0) + 1 = 1.
(1)^3 - 1 = 0, but zero isn't divisible by 4.
How is (A) sufficient?
4GMAT_Mumbai wrote:Hi,
Interesting Q ... Thanks !
1. n is an odd number
n^3 - n = (n-1) * n * (n+1) = Product of three consecutive integers
We know that n is an odd number. So, the number before and after n must both be even numbers. So, n^3-n will definitely be divisible by 4. Suff
2. n^2 + n = n (n+1) is divisible by 6
n could be 2. n^3 - n is NOT divisible by 4.
n could be 3. n^3 - n is divisible by 4.
I am getting both 'Yes' and 'No' for an answer for different values of n which satisfy the Statement 2. Hence, Insuff.
My answer would be A ... OA please ... Thanks.