[07-09-17-T12]

Mathematical Induction
Use mathematical induction to prove the following.
[1] 1 +4 +9 ++n
2
=
nHn+1L H2 n+1L
6
, n
[2] Where F
1
, F
2,
etc. are the Fibonacci numbers, prove
F
1
+F
2
++F
n
= F
n+2
-1
[3] H2 nL! < Hn!L
2
4
n-1
for " n , n 5
[4]
1
12
+
1
23
++
1
Hn-1L n
=
n-1
n
for n = 2, 3, 4,
[5] 6 In
3
+5 nM for " n
+

[6]
135H2 n-1L
246H2 nL

1
2 n
, n
+
[7]
H4 n-2L!
8
n
= an integer, for n = 5, 6, 7,
[8] Let n
+
and A
1
, A
2
, , A
n
subsets of .
Prove A
1
A
2
A
3
A
n
= A
1
A
2
A
n
[9] 2 6 10 14 H4 n -2L =
H2 nL!
n!
[10] (Bernoulli's Inequality)
Let a > -1
Thm H1 +aL
n
1 +n a, for n = 0, 1, 2, , a constant
[11] 1 3 5 7 H2 n -1L 2 4 6 H2 n -2L, n 2, n
[12] F
n
I
5
4
M
n
, n 3, F
n
= n th Fibonacci number
07-09-17-T12 Proofs by mathematical induction.nb -RT p. 1
[13] 9 H4
n
+5
n
L, n odd
[14] Definition. If a is a real number, then a
1
= a and, for every positive integer k, a
k+1
= a
k
a
Prove: a
m
a
n
= a
m+n
[15] (DeMoivre Thm)
If z = z Hcos f +i sin fL, then z
n
= z
n
Hcos n f +i sin n fL for each natural number n.
[16] a b Hmod mLa
k
b
k
Hmod mL for each positive integer k.
07-09-17-T12 Proofs by mathematical induction.nb -RT p. 2