remainder problem

[gibran]

What is the remainder when the positive integer n is divided by 3?
(1) The remainder when n is divided by 2 is 1.
(2) The remainder when n + 1 is divided by 3 is 2.
A. Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
B. Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
C. BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.
D. EACH statement ALONE is sufficient.
E. Statements (1) and (2) TOGETHER are NOT sufficient.

OA is B.

[GMAT08]

IMO - Ans is B

From statement 1) we know that n=odd since there is a remainder of 1 when divided by 2. ie all multiples of two are even. However, this info is INSUFF to know what the remainder is when n is divided by 3 since n could be 3 (so rem=0) or n could be 5 (rem=2).
From statement 2) since we know that the remainder is 2 when n+1 is divided by 3, then the possible values of n+1 are 5, 8, 11, etc. And the remainder when n is divided by 3 is 1. So n=4,7,10, etc.. SUFF.

[bose]

imo B from cond 2 we get n=3k+1 so remainder will be 1 when n/3

[mannu08]

Imo = Oa