Let the given statement be $P(n)$,i.e.,
$P(n): 1 \cdot 3 + 2 \cdot 3^{2} + 3 \cdot 3^{3} + \ldots + n \cdot 3^{n} = \frac{(2n - 1) 3^{n+1} + 3}{4}$
For $n = 1$,we have
$P(1): 1 \cdot 3 = 3 = \frac{(2 \cdot 1 - 1) 3^{1+1} + 3}{4} = \frac{3^{2} + 3}{4} = \frac{12}{4} = 3$,which is true.
Let $P(k)$ be true for some positive integer $k$,i.e.,
$1 \cdot 3 + 2 \cdot 3^{2} + 3 \cdot 3^{3} + \ldots + k \cdot 3^{k} = \frac{(2k - 1) 3^{k+1} + 3}{4}$ $(i)$
We shall now prove that $P(k+1)$ is true.
Consider the sum up to $(k+1)$ terms:
$(1 \cdot 3 + 2 \cdot 3^{2} + \ldots + k \cdot 3^{k}) + (k+1) \cdot 3^{k+1}$
$= \frac{(2k - 1) 3^{k+1} + 3}{4} + (k+1) 3^{k+1}$ [Using $(i)$]
$= \frac{(2k - 1) 3^{k+1} + 3 + 4(k+1) 3^{k+1}}{4}$
$= \frac{3^{k+1} \{2k - 1 + 4k + 4\} + 3}{4}$
$= \frac{3^{k+1} \{6k + 3\} + 3}{4}$
$= \frac{3^{k+1} \cdot 3 \{2k + 1\} + 3}{4}$
$= \frac{3^{(k+1)+1} \{2(k+1) - 1\} + 3}{4}$
Thus,$P(k+1)$ is true whenever $P(k)$ is true.
Hence,by the principle of mathematical induction,the statement $P(n)$ is true for all $n \in N$.