For all is a multiple of
Let the given statement be P(n).
is a multiple of 3.
Step l: For n=1,
which is a multiple of 3, that is true
Step lI: Let it is true for n = k,
Step III: For n=k+1,
which is a multiple of 3.
Therefore, P(k + 1) is true when P(k) is true.
Hence, from the principle of mathematical induction, the statement is true for all natural numbers n.