Induction generally can only be used on integer
arguments because the proof depends on a process
that hits every number. Keeping this in mind, here
is a general guideline that should assist you in
solving the induction problem above:

Firstly, make sure you know where you are
starting from. It is usually a good idea to
include both 0 and 1 in the base cases. (They
can be calculated by hand and then assumed in the
rest of the induction.)

f(0) = 0
f(1) = 1

In induction, we assume that we have already proved
that f(m) = m for all values of m <= k, and then
we prove that f(k+1) = k+1. This should help you
get started on your inductive proof.

Sanjay
Sanjay