Pure Mathematics – Mathematical Induction p.

Mathematical Induction
Assignment
Prove the following by mathematical induction:
1. For every positive integer n, 2 n + 3 n = 6 N + 5 n where N is an integer.

2.
(2n )! is an integer for every positive integer n.
2n
3. Let {Fn} be a sequence which satisfies the following relation:
Fn+2 = Fn + Fn+1 for every positive integer n, and
F1 = F2 = 1
n n
1 ⎛1+ 5 ⎞ 1 ⎛1− 5 ⎞
(a) Show that Fn = ⎜ ⎟ − ⎜ ⎟ for every integer n.
5 ⎜⎝ 2 ⎟⎠ 5 ⎜⎝ 2 ⎟⎠

(b) Show that Fn+2 – 1 = F1 + F2 + … + Fn for every integer n.

n
⎛5⎞
(c) Fn ≥ ⎜ ⎟ for every integer n ≥ 3.
⎝4⎠

4. Any integer n > 23 can be written in the form 5r + 7s for some nonnegative
integers r and s.
1 1 1
5. + +K+ > n for all integers n ≥ 2.
1 2 n
6. A sequence {an} is defined by a1 = 1, a2 = 3 and an+2 = 3an+1 + 2an for all n = 1, 2,
3, …. Using mathematical induction, prove that

1 ⎡⎛ 3 + 17 ⎞ ⎛ 3 − 17 ⎞ ⎤
n n

an = ⎢⎜ ⎟ −⎜ ⎟ ⎥ for any positive integer n.

17 ⎢⎜⎝ 2 ⎟⎠ ⎜⎝ 2 ⎟⎠ ⎥
⎣ ⎦

7. For each positive integer n, define S n = 1 + 5 ( ) + (1 − 5 ) .

n n

(a) Sn+2 = 2Sn+1 + 4Sn,

(b) Sn is divisible by 2n.
8. For any positive integer n, prove that
tn – 1 ≥ n(t – 1) for all t > 0.
Hint: Use differentiation to find the maximum / minimum.
9. Let {an} be a sequence of positive real numbers, where a1 = 1 and
12a n −1 + 12
an= , n = 2, 3, 4, ….
a n −1 + 13
Prove that an ≤ 3 for all positive integers n.
Pure Mathematics – Mathematical Induction p.2

10. Let {xn} be a sequence of positive real numbers, where x1 = 2 and

xn+1 = xn2 – xn + 1 for all n = 1, 2, 3, …
n
1
Define S n = ∑ for all n = 1, 2, 3, ….
i =1 x i

Prove that for any positive integer n,

(a) xn > n,
1
(b) S n = 1 −
x n +1 − 1

11. A sequence {an} is defined as a1 = 1, a2 = 3 and an+2 = 2an+1 + an for n = 1, 2,

3, …. Prove that

an =
(1 + 2 ) + (1 − 2 )
n n

for n = 1, 2, 3, …
2