Prove by mathematical induction that is divisible by
for all positive integral values of
.
Solution.
Let be the statement that
First, we wish to show holds true.
is true.
Once we assume that is true for some positive integral values, we wish to show
is true.
Let .
Suppose we can divide by
, i.e.,
for some where
.
Then, let’s see
Plugging in ,
,
, and
, we have
We have a set of five equations below:
which can be summarized to
,
that is equivalent to saying
,
viz. I have been wasting time over a circular reasoning of no use.
I should have tried to attest otherwise that is of some positive integral values, even though this is
proving the statement
by mathematical induction firsthand.
Reformulation.
To show that the following statement holds true:
.
is true because
is an integer.
Assume is true for some
.
Then,
The first term is an integer for is assumed to be true. We then need to check whether the second term is of integral value(s).
The second term, after simplification, is
,
obviously an integer.
thus holds.
Because is true, by mathematical induction,
is true for all positive integers
.
Escape to the original statement.
Because is true, by mathematical induction,
is true for any positive integers
.