This is the approach I ve seen in one of the Manhattan Gmat forums. But I edited this to show u my point.. Can any of u guys solve my problem....


Well, I personally would go for a numerical approach for this one, but here's a way to work it algebraically:

Let n = 3j + 2, where j is a positive integer
Let t = 5k + 3, where k is a positive integer

nt = (3j+2)(5k+3) = 15jk + 9j + 10k + 6

So the question is: what is the remainder after 15jk + 9j + 10k + 6 is divided by 15? Well, 15jk is clearly divisible by 15. If we show that 9j and 10k are divisible by 15 as well, then we can determine the remainder (6).

(1) The fact that n - 2 is divisible by 5 means that 3j is divisible by 5. So j can be written as 5x, where x is a positive integer. That means we can rewrite 9j (in the question) as 45x, which is divisible by 15. But we don't know whether 10k is divisible by 15.But we do know that 10k+6 is certainly not divisible by 15. Since 10k+6 has either 6 or 1 as units digit, neither of which is an units digit in any of the numbers divisible by 15. So nt is not divisible by 15. We can answer the question.. SUFFUCIENT

(2) That t is divisible by 3 means that 5k + 3 is divisible by 3, and therefore 5k is divisible by 3. So k can be written as 3y, where y is a positive integer. That means we can rewrite 10k (in the question) as 30y, which is divisible by 15. But we don't know whether 9j is divisible by 15. Insufficient.

[spoiler]So A.

But the OA is C[/spoiler]...Please help....................