Correct Answer - Option 2 : Only C is correct

**Formula Used:**

Remainder Theorem

Dividend = (Divisor × Quotient) + Remainder

**Calculation:**

Using above formula,

n = 3k + 1, where k = 0,1,2,…

There are two possibilities for the number to be divided by 3 completely

n - 1 and n + 2

n – 1 = 3k + 1 – 1 = 3k where k = 0,1,2,…

But if k = 0, n – 1 = 0 which is **not **a positive integer.

(∵ n - 1 is negative for n = 0)

n + 2 = 3k + 1 + 2 = 3k + 3 = 3(k +1) where k = 0,1,2,…

**n + 2 is the positive integer that gives a remainder of 0 when divided by 3.**

**∴ ****Only C is correct**