MA
if n is not divisible by either 2 or 3, n is a prime>3
Answer should be C but this reasoning seems wrong.
How about n = 25, 35? These are not prime numbers and not divisible by 2 or 3.
St1: (n-1) is divisible by 2 and (n+1) is divisible by 2.
for n = 7, r = 0 and for n = 9, r = 8: INSUFF
St2: If n/3 remainder is 1 then r = 0 and if n/3 remainder is 2 then remainder is 15
for n = 7, r = 0 and for n = 8, r = 15
Combined: This means n is a odd number which is not divisible by 3 i.e n = 5, 7, 11, 13, 17, 23, 25 etc...
In all these cases either (n-1) or (n+1) will be a multiple of 4 and other will be a multiple of 6. So remainder will be 0.