Remainder problem in Gmatprep

jayhawk2001 wrote:Any quick way to solve this. I got this question on gmatprep and
ended up fumbling (and moving on in the interest of time).

Upon reviewing I found out what the error was on my part but
would like to hear alternate approaches to attack this kind of problem.

1 is sufficient
it refers to a number of the format 6k+3 (k an integer)
[ a number not divisible by 2 can be represented 2k+1
when this number is divisible by 3 it can be represented 3*(2k+1)
]

so when divided by 6 it will leave a remainder of 3

2 is also sufficient
it refers to a number of the format 12k+3 (k an integer)
which leaves a remainder of 3 when divided by 6

Agree with Ajith D is the answer.

Yes, the answer is indeed D. Thanks guys.