Professional Documents
Culture Documents
Mathematical Induction
The Mathematical Induction is a very powerful tool for proving infinitely many
propositions by using only a few steps. In particular, it can be used often when the
propositions are involving the nonnegative integer n.
Note that it seems to be more difficult for using the second induction, since
it require more conditions. However it is actually not so. We can use either one
freely if necessary.
1
2 Lecture 16 Mathematical Induction
Examples
n2 .n C 1/2
Example 1. Prove by induction that 13 C 23 C C n3 D for each
4
n 2 N. Hence prove that 13 C 33 C 53 C C .2n 1/3 D n2 .2n2 1/ for each
n 2 N.
Solution Let Pn be the statement
n2 .n C 1/2
13 C 23 C C n3 D ; n D 1; 2; : : : :
4
12.1 C 1/2
For n D 1, left hand side D 1 D D right hand side, P1 is proven.
4
k 2 .k C 1/2
Assume that Pk is true (k 1), i.e. 13 C 23 C C k 3 D , then
4
for n D k C 1,
13 C 23 C C .k C 1/3 D 13 C 23 C C k 3 C .k C 1/3
k 2 .k C 1/2 .k C 1/2 .k C 1/2 .k C 2/2
D C .k C 1/3 D Œk 2 C 4.k C 1/ D :
4 4 4
Thus, PkC1 is also true. By induction, Pn is true for each n 2 N.
integer n,
1 1 1
a0 a1 an C CC D 1:
a0 a1 an
Solution The given condition yields 1 anC1 D an .1 an /; n 2 N0 , hence
1 anC1 D an an 1 .1 an 1/ D D an a1 .1 a1 / D an a1 a0 ;
namely
anC1 D 1 a0 a1 an ; n D 1; 2; : : : :
We now prove the original conclusion
by induction.
1 1
For n D 1, a0 a1 C D a0 C a1 D 1, the conclusion is proven.
a0 a1
Assume that the proposition is true for n D k, then for n D k C 1,
1 1 1
a0 a1 akC1 C CC
a0 a1 akC1
1 1 1
D a0 a1 ak C CC akC1 C a0 a1 ak
a0 a1 ak
D akC1 C a0 a1 ak D 1:
Thus, the proposition is true for n D k C 1 also. By induction, the conclusion is
true for all n 2 N.
Example 3. (IMO/Shortlist/2006) The sequence of real numbers a0 ; a1 ; a2 ; : : : is
defined recursively by
n
X an k
a0 D 1; D 0 for n 1:
kC1
kD0
Show that an > 0 for n 1.
Solution The proof goes by induction on n. For n D 1 the formula yields
a1 D 1=2. Take n 1 and assume a1 ; : : : ; an > 0. Write the recurrence formula
for n and n C 1 respectively as
n nC1
X ak X ak
D0 and D 0:
n kC1 n kC2
kD0 kD0
Subtraction yields
nC1 n
ak
X X ak
0 D .n C 2/ .n C 1/
n kC2 n kC1
kD0 kD0
n
X nC2 nC1
D .n C 2/anC1 C ak :
n k C2 n k C1
kD0
4 Lecture 16 Mathematical Induction
prove that xi D yi ; i D 1; 2; : : : ; s.
kC1 k k
q
2k k
q
2k k
2X 2
X 2
X 2
Y 2
Y
k k
aj D aj C aj C2k 2 aj C 2 aj C2k
j D1 j D1 j D1 j D1 j D1
q
2kC1 kC1
q
2kC1 kC1
2Y 2Y
k kC1
2 2 aj D 2 aj :
j D1 j D1
Thus, the proposition is proven for t D k C 1. By induction, () is proven for all
n D 2t ; t D 1; 2; : : :.
Next we prove () for each n 2 N. For any n 2 N which is not of the form 2t ,
there exist an s 2 N such that 2s 1 < n < 2s . Since
ps
a1 Ca2 C Ca2s 2s 2 a1 a2 a2s ; ./
p
By letting anC1 D anC2 D D a2s D n a1 a2 an in (), () yields
p
a1 C a2 C C an C .2s n/ n a1 a2 an
q
2s 2s n p
2s .a1 a2 an /.a1 a2 an / n D 2s n a1 a2 an ;
p
) a1 C a2 C C an n n a1 a2 an ;
hence ./ is proven for general n 2 N.
Example 6. (CMC/2007) For each positive integer n > 1, prove that
2n 1 1 1 25
< C CC < :
3n C 1 nC1 nC2 nCn 36
Solution To prove the left inequality, define
1 1 1 2n
f .n/ D C CC ; n 2 N:
nC1 nC2 nCn 3n C 1
1 1 1 2n C 2
Then f .n C 1/ D C CC , so
nC2 nC3 2n C 2 3n C 4
1 1 2n 2n C 2
f .n C 1/ f .n/ D C
2n C 1 2n C 2 3n C 1 3n C 4
1 2
D
.2n C 1/.2n C 2/ .3n C 1/.3n C 4/
n.n C 3/
D > 0;
.2n C 1/.2n C 2/.3n C 1/.3n C 4/
6 Lecture 16 Mathematical Induction
Solution As the first step, we prove the conclusion for all n with the form
2m by induction on m. For m D 1, the inequality () becomes
1 1 2
C p
1 C a1 1 C a2 1 C a1 a2
Lecture Notes on Mathematical Olympiad 7
or equivalently:
p
2.1 C a1 /.1 C a2 / .2 C a1 C a2 /. a1 a2 C 1/;
p
a1 C a2 C 2a1 a2 .2 C a1 C a2 / a1 a2 ;
p p p
.a1 C a2 /.1 a1 a2 / 2 a1 a2 .1 a1 a2 / 0;
p p 2 p
. a1 a2 / .1 a1 a2 / 0:
2 k
X 1 2k
p
k
:
1 C ai 1 C 2 a1 a2 a2k
i D1
Then, for m D k C 1
kC1
2X k
2 2 k
1 X 1 1 X 1
D C 2 p
1 C ai 1 C a2i 1 1 C a2i 1 C a2i 1 a2i
i D1 i D1 i D1
k
2
2 qp p
2k p
1C a1 a2 a3 a4 a2kC1 1 a2kC1
2kC1
D p :
1 C 2kC1 a1 a2 a2kC1
k 1
X 1 1
C p
1 C ai 1C a1 a2 ak 1
k 1
i D1
k k
p p D p ;
1 C k a1 a2 ak 1 k 1 a1 a2 ak 1 1C k 1 a1 a2 ak 1
therefore we have
k
X1 1 k 1
p :
1 C ai 1C k 1a1 a2 ak 1
i D1
2 2
Solution Let Pn W FnC1 C Fn2 D F2nC1 ; Qn W 2FnC1 Fn C FnC1 D F2nC2
for n D 1; 2; : : :.
When n D 1, then P1 ; Q1 are obvious since F1 D F2 D 1.
2
When Pk ; Qk are true for n D k (k 1), i.e., FkC1 C Fk2 D 2F2kC1 and
2
2FkC1 Fk C FkC1 D F2kC2 , then
2 2
FkC2 C FkC1 D .FkC1 C Fk /2 C FkC1
2