SlideShare ist ein Scribd-Unternehmen logo
1 von 15
Downloaden Sie, um offline zu lesen
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
In Exercises 1-15 use mathematical induction to establish the formula for n ≥ 1.
1. 12
+ 22
+ 32
+ · · · + n2
=
n(n + 1)(2n + 1)
6
Proof:
For n = 1, the statement reduces to 12
=
1 · 2 · 3
6
and is obviously true.
Assuming the statement is true for n = k:
12
+ 22
+ 32
+ · · · + k2
=
k(k + 1)(2k + 1)
6
, (1)
we will prove that the statement must be true for n = k + 1:
12
+ 22
+ 32
+ · · · + (k + 1)2
=
(k + 1)(k + 2)(2k + 3)
6
. (2)
The left-hand side of (2) can be written as
12
+ 22
+ 32
+ · · · + k2
+ (k + 1)2
.
In view of (1), this simplifies to:
12
+ 22
+ 32
+ · · · + k2
+ (k + 1)2
=
k(k + 1)(2k + 1)
6
+ (k + 1)2
=
k(k + 1)(2k + 1) + 6(k + 1)2
6
=
(k + 1)[k(2k + 1) + 6(k + 1)]
6
=
(k + 1)(2k2
+ 7k + 6)
6
=
(k + 1)(k + 2)(2k + 3)
6
.
Thus the left-hand side of (2) is equal to the right-hand side of (2). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
2. 3 + 32
+ 33
+ · · · + 3n
=
3n+1
− 3
2
Proof:
For n = 1, the statement reduces to 3 =
32
− 3
2
and is obviously true.
Assuming the statement is true for n = k:
3 + 32
+ 33
+ · · · + 3k
=
3k+1
− 3
2
, (3)
we will prove that the statement must be true for n = k + 1:
3 + 32
+ 33
+ · · · + 3k+1
=
3k+2
− 3
2
. (4)
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
The left-hand side of (4) can be written as
3 + 32
+ 33
+ · · · + 3k
+ 3k+1
.
In view of (3), this simplifies to:
3 + 32
+ 33
+ · · · + 3k
+ 3k+1
=
3k+1
− 3
2
+ 3k+1
=
3k+1
− 3 + 2 · 3k+1
2
=
3 · 3k+1
− 3
2
=
3k+2
− 3
2
.
Thus the left-hand side of (4) is equal to the right-hand side of (4). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
3. 13
+ 23
+ 33
+ · · · + n3
=
n2
(n + 1)2
4
Proof:
For n = 1, the statement reduces to 13
=
12
· 22
4
and is obviously true.
Assuming the statement is true for n = k:
13
+ 23
+ 33
+ · · · + k3
=
k2
(k + 1)2
4
, (5)
we will prove that the statement must be true for n = k + 1:
13
+ 23
+ 33
+ · · · + (k + 1)3
=
(k + 1)2
(k + 2)2
4
. (6)
The left-hand side of (6) can be written as
13
+ 23
+ 33
+ · · · + k3
+ (k + 1)3
.
In view of (5), this simplifies to:
13
+ 23
+ 33
+ · · · + k3
+ (k + 1)3
=
k2
(k + 1)2
4
+ (k + 1)3
=
k2
(k + 1)2
+ 4(k + 1)3
4
=
(k + 1)2
[k2
+ 4(k + 1)]
4
=
(k + 1)2
(k + 2)2
4
.
Thus the left-hand side of (6) is equal to the right-hand side of (6). This
proves the inductive step. Therefore, by the principle of mathematical
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
induction, the given statement is true for every positive integer n.
4. 1 + 3 + 6 + 10 + · · · +
n(n + 1)
2
=
n(n + 1)(n + 2)
6
Proof:
For n = 1, the statement reduces to 1 =
1 · 2 · 3
6
and is obviously true.
Assuming the statement is true for n = k:
1 + 3 + 6 + 10 + · · · +
k(k + 1)
2
=
k(k + 1)(k + 2)
6
, (7)
we will prove that the statement must be true for n = k + 1:
1 + 3 + 6 + 10 + · · · +
(k + 1)(k + 2)
2
=
(k + 1)(k + 2)(k + 3)
6
. (8)
The left-hand side of (8) can be written as
1 + 3 + 6 + 10 + · · · +
k(k + 1)
2
+
(k + 1)(k + 2)
2
.
In view of (7), this simplifies to:
1 + 3 + 6 + 10 + · · · +
k(k + 1)
2
+
(k + 1)(k + 2)
2
=
k(k + 1)(k + 2)
6
+
(k + 1)(k + 2)
2
=
k(k + 1)(k + 2) + 3(k + 1)(k + 2)
6
=
(k + 1)(k + 2)(k + 3)
6
.
Thus the left-hand side of (8) is equal to the right-hand side of (8). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
5. 1 + 4 + 7 + · · · + (3n − 2) =
n(3n − 1)
2
Proof:
For n = 1, the statement reduces to 1 =
1 · 2
2
and is obviously true.
Assuming the statement is true for n = k:
1 + 4 + 7 + · · · + (3k − 2) =
k(3k − 1)
2
, (9)
we will prove that the statement must be true for n = k + 1:
1 + 4 + 7 + · · · + [3(k + 1) − 2] =
(k + 1)[3(k + 1) − 1]
2
. (10)
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
The left-hand side of (10) can be written as
1 + 4 + 7 + · · · + (3k − 2) + [3(k + 1) − 2].
In view of (9), this simplifies to:
[1 + 4 + 7 + · · · + (3k − 2)] + (3k + 1) =
k(3k − 1)
2
+ (3k + 1)
=
k(3k − 1) + 2(3k + 1)
2
=
3k2
+ 5k + 2
2
=
(k + 1)(3k + 2)
2
.
The last expression is obviously equal to the right-hand side of (10). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
6. 12
+ 32
+ 52
+ · · · + (2n − 1)2
=
n(2n − 1)(2n + 1)
3
Proof:
For n = 1, the statement reduces to 12
=
1 · 3 · 3
3
and is obviously true.
Assuming the statement is true for n = k:
12
+ 32
+ 52
+ · · · + (2k − 1)2
=
k(2k − 1)(2k + 1)
3
, (11)
we will prove that the statement must be true for n = k + 1:
12
+ 32
+ 52
+ · · · + [2(k + 1) − 1]2
=
(k + 1)[2(k + 1) − 1][2(k + 1) + 1]
3
.
(12)
The left-hand side of (12) can be written as
12
+ 32
+ 52
+ · · · + (2k − 1)2
+ [2(k + 1) − 1]2
.
In view of (11), this simplifies to:
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
12
+ 32
+ 52
+ · · · + (2k − 1)2
+ (2k + 1)2
=
k(2k − 1)(2k + 1)
3
+ (2k + 1)2
=
k(2k − 1)(2k + 1) + 3(2k + 1)2
3
=
(2k + 1)[k(2k − 1) + 3(2k + 1)]
3
=
(2k + 1)(2k2
+ 5k + 3)
3
=
(2k + 1)(k + 1)(2k + 3)
3
=
(k + 1)[2(k + 1) − 1][2(k + 1) + 1]
3
.
Thus the left-hand side of (12) is equal to the right-hand side of (12). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
7. 1 + 5 + 9 + 13 + · · · + (4n − 3) = 2n2
− n
Proof:
For n = 1, the statement reduces to 1 = 2 · 12
− 1 and is obviously true.
Assuming the statement is true for n = k:
1 + 5 + 9 + 13 + · · · + (4k − 3) = 2k2
− k , (13)
we will prove that the statement must be true for n = k + 1:
1 + 5 + 9 + 13 + · · · + [4(k + 1) − 3] = 2(k + 1)2
− (k + 1) . (14)
The left-hand side of (14) can be written as
1 + 5 + 9 + 13 + · · · + (4k − 3) + [4(k + 1) − 3].
In view of (13), this simplifies to:
[1 + 5 + 9 + 13 · · · + (4k − 3)] + (4k + 1) = (2k2
− k) + (4k + 1)
= 2k2
+ 3k + 1 = (k + 1)(2k + 1)
= (k + 1)[2(k + 1) − 1]
= 2(k + 1)2
− (k + 1).
Thus the left-hand side of (14) is equal to the right-hand side of (14). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
8. 2 + 23
+ 25
+ · · · + 22n−1
=
2(22n
− 1)
3
Proof:
For n = 1, the statement reduces to 2 =
2(22
− 1)
3
and is obviously true.
Assuming the statement is true for n = k:
2 + 23
+ 25
+ · · · + 22k−1
=
2(22k
− 1)
3
, (15)
we will prove that the statement must be true for n = k + 1:
2 + 23
+ 25
+ · · · + 22(k+1)−1
=
2(22(k+1)
− 1)
3
. (16)
The left-hand side of (16) can be written as
2 + 23
+ 25
+ · · · + 22k−1
+ 22(k+1)−1
.
In view of (15), this simplifies to:
2 + 23
+ 25
+ · · · + 22k−1
+ 22k+1
=
2(22k
− 1)
3
+ 22k+1
=
2(22k
− 1) + 3 · 22k+1
3
=
22k+1
− 2 + 3 · 22k+1
3
=
4 · 22k+1
− 2
3
=
2(2 · 22k+1
− 1)
3
=
2(22k+2
− 1)
3
.
The last expression is obviously equal to the right-hand side of (16). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
9.
1
1 · 2 · 3
+
1
2 · 3 · 4
+
1
3 · 4 · 5
+ · · · +
1
n(n + 1)(n + 2)
=
n(n + 3)
4(n + 1)(n + 2)
Proof:
For n = 1, the statement reduces to
1
1 · 2 · 3
=
1 · 4
4 · 2 · 3
and is obviously
true.
Assuming the statement is true for n = k:
1
1 · 2 · 3
+
1
2 · 3 · 4
+
1
3 · 4 · 5
+ · · · +
1
k(k + 1)(k + 2)
=
k(k + 3)
4(k + 1)(k + 2)
,
(17)
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
we will prove that the statement must be true for n = k + 1:
1
1 · 2 · 3
+
1
2 · 3 · 4
+
1
3 · 4 · 5
+· · ·+
1
(k + 1)(k + 2)(k + 3)
=
(k + 1)(k + 4)
4(k + 2)(k + 3)
.
(18)
The left-hand side of (18) can be written as
1
1 · 2 · 3
+
1
2 · 3 · 4
+
1
3 · 4 · 5
+· · ·+
1
k(k + 1)(k + 2)
+
1
(k + 1)(k + 2)(k + 3)
.
In view of (17), this simplifies to:
1
1 · 2 · 3
+
1
2 · 3 · 4
+
1
3 · 4 · 5
+ · · · +
1
k(k + 1)(k + 2)
+
1
(k + 1)(k + 2)(k + 3)
=
k(k + 3)
4(k + 1)(k + 2)
+
1
(k + 1)(k + 2)(k + 3)
=
k(k + 3)2
+ 4
4(k + 1)(k + 2)(k + 3)
=
k(k2
+ 6k + 9) + 4
4(k + 1)(k + 2)(k + 3)
=
k3
+ 6k2
+ 9k + 4
4(k + 1)(k + 2)(k + 3)
=
(k + 1)(k2
+ 5k + 4)
4(k + 1)(k + 2)(k + 3)
=
k2
+ 5k + 4
4(k + 2)(k + 3)
=
(k + 1)(k + 4)
4(k + 2)(k + 3)
.
Thus the left-hand side of (18) is equal to the right-hand side of (18). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
10. 43
+ 83
+ 123
+ · · · + (4n)3
= 16n2
(n + 1)2
Proof:
For n = 1, the statement reduces to 43
= 16 · 12
· 22
and is obviously true.
Assuming the statement is true for n = k:
43
+ 83
+ 123
+ · · · + (4k)3
= 16k2
(k + 1)2
, (19)
we will prove that the statement must be true for n = k + 1:
43
+ 83
+ 123
+ · · · + [4(k + 1)]3
= 16(k + 1)2
(k + 2)2
. (20)
The left-hand side of (20) can be written as
43
+ 83
+ 123
+ · · · + (4k)3
+ [4(k + 1)]3
.
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
In view of (19), this simplifies to:
43
+ 83
+ 123
+ · · · + (4k)3
+ 43
(k + 1)3
= 16k2
(k + 1)2
+ 64(k + 1)3
= 16(k + 1)2
[k2
+ 4(k + 1)]
= 16(k + 1)2
(k + 2)2
.
Thus the left-hand side of (20) is equal to the right-hand side of (20). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
11.
1
52
+
1
54
+ · · · +
1
52n
=
1
24
1 −
1
25n
Proof:
For n = 1, the statement reduces to
1
52
=
1
24
1 −
1
25
. This is equivalent
to
1
25
=
1
24
·
24
25
and is obviously true.
Assuming the statement is true for n = k:
1
52
+
1
54
+ · · · +
1
52k
=
1
24
1 −
1
25k
, (21)
we will prove that the statement must be true for n = k + 1:
1
52
+
1
54
+ · · · +
1
52(k+1)
=
1
24
1 −
1
25k+1
. (22)
The left-hand side of (22) can be written as
1
52
+
1
54
+ · · · +
1
52k
+
1
52(k+1)
.
In view of (21), this simplifies to:
1
52
+
1
54
+ · · · +
1
52k
+
1
52(k+1)
=
1
24
1 −
1
25k
+
1
52(k+1)
=
25k
− 1
24 · 25k
+
1
25k+1
=
25(25k
− 1) + 24
24 · 25k+1
=
25k+1
− 25 + 24
24 · 25k+1
=
1
24
·
25k+1
− 1
25k+1
=
1
24
1 −
1
25k+1
.
Thus the left-hand side of (22) is equal to the right-hand side of (22). This
proves the inductive step. Therefore, by the principle of mathematical
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
induction, the given statement is true for every positive integer n.
12. 2−1
+ 2−2
+ 2−3
+ · · · + 2−n
= 1 − 2−n
Proof:
For n = 1, the statement reduces to 2−1
= 1 − 2−1
and is obviously true.
Assuming the statement is true for n = k:
2−1
+ 2−2
+ 2−3
+ · · · + 2−k
= 1 − 2−k
, (23)
we will prove that the statement must be true for n = k + 1:
2−1
+ 2−2
+ 2−3
+ · · · + 2−(k+1)
= 1 − 2−(k+1)
. (24)
The left-hand side of (24) can be written as
2−1
+ 2−2
+ 2−3
+ · · · + 2−k
+ 2−(k+1)
.
In view of (23), this simplifies to:
2−1
+ 2−2
+ 2−3
+ · · · + 2−k
+ 2−(k+1)
= 1 − 2−k
+ 2−(k+1)
= 1 − 2 · 2−(k+1)
+ 2−(k+1)
= 1 − 2−(k+1)
.
Thus the left-hand side of (24) is equal to the right-hand side of (24). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
13. 1 · 2 + 2 · 3 + 3 · 4 + · · · + n(n + 1) =
n(n + 1)(n + 2)
3
Proof:
For n = 1, the statement reduces to 1 · 2 =
1 · 2 · 3
3
and is obviously true.
Assuming the statement is true for n = k:
1 · 2 + 2 · 3 + 3 · 4 + · · · + k(k + 1) =
k(k + 1)(k + 2)
3
, (25)
we will prove that the statement must be true for n = k + 1:
1 · 2 + 2 · 3 + 3 · 4 + · · · + (k + 1)(k + 2) =
(k + 1)(k + 2)(k + 3)
3
. (26)
The left-hand side of (26) can be written as
1 · 2 + 2 · 3 + 3 · 4 + · · · + k(k + 1) + (k + 1)(k + 2).
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
In view of (25), this simplifies to:
[1 · 2 + 2 · 3 + 3 · 4 + · · · + k(k + 1)] + (k + 1)(k + 2)
=
k(k + 1)(k + 2)
3
+ (k + 1)(k + 2)
=
k(k + 1)(k + 2) + 3(k + 1)(k + 2)
3
=
(k + 1)(k + 2)(k + 3)
3
.
Thus the left-hand side of (26) is equal to the right-hand side of (26). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
14. 1(2−1
) + 2(2−2
) + 3(2−3
) + · · · + n(2−n
) = 2 − (n + 2)2−n
Proof:
For n = 1, the statement reduces to 1(2−1
) = 2 − 3 · 2−1
. This is equiva-
lent to
1
2
= 2 −
3
2
and is obviously true.
Assuming the statement is true for n = k:
1(2−1
) + 2(2−2
) + 3(2−3
) + · · · + k(2−k
) = 2 − (k + 2)2−k
, (27)
we will prove that the statement must be true for n = k + 1:
1(2−1
)+2(2−2
)+3(2−3
)+· · ·+(k +1)[2−(k+1)
] = 2−(k +3)2−(k+1)
. (28)
The left-hand side of (28) can be written as
1(2−1
) + 2(2−2
) + 3(2−3
) + · · · + k(2−k
) + (k + 1)[2−(k+1)
].
In view of (27), this simplifies to:
1(2−1
) + 2(2−2
) + 3(2−3
) + · · · + k(2−k
) + (k + 1)[2−(k+1)
]
= 2 − (k + 2)2−k
+ (k + 1)[2−(k+1)
]
= 2 − 2(k + 2)[2−(k+1)
] + (k + 1)[2−(k+1)
]
= 2 − [2(k + 2) − (k + 1)][2−(k+1)
]
= 2 − (k + 3)2−(k+1)
.
Thus the left-hand side of (28) is equal to the right-hand side of (28). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
15. 1(1!) + 2(2!) + 3(3!) + · · · + n(n!) = (n + 1)! − 1
Proof:
For n = 1, the statement reduces to 1(1!) = 2! − 1 and is obviously true.
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
Assuming the statement is true for n = k:
1(1!) + 2(2!) + 3(3!) + · · · + k(k!) = (k + 1)! − 1 , (29)
we will prove that the statement must be true for n = k + 1:
1(1!) + 2(2!) + 3(3!) + · · · + (k + 1)[(k + 1)!] = (k + 2)! − 1 . (30)
The left-hand side of (30) can be written as
1(1!) + 2(2!) + 3(3!) + · · · + k(k!) + (k + 1)[(k + 1)!].
In view of (29), this simplifies to:
[1(1!) + 2(2!) + 3(3!) + · · · + k(k!)] + (k + 1)[(k + 1)!]
= (k + 1)! − 1 + (k + 1)[(k + 1)!]
= [1 + (k + 1)][(k + 1)!] − 1
= (k + 2)[(k + 1)!] − 1
= (k + 2)! − 1.
Thus the left-hand side of (30) is equal to the right-hand side of (30). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the given statement is true for every positive integer n.
16. Find and verify a formula for the sum
1
1 · 2
+
1
2 · 3
+
1
3 · 4
+ · · · +
1
n(n + 1)
, n ≥ 1 .
Solution: We can evaluate the sum for the first few values of n:
n = 1 :
1
1 · 2
=
1
2
n = 2 :
1
1 · 2
+
1
2 · 3
=
2
3
n = 3 :
1
1 · 2
+
1
2 · 3
+
1
3 · 4
=
3
4
n = 4 :
1
1 · 2
+
1
2 · 3
+
1
3 · 4
+
1
4 · 5
=
4
5
n = 5 :
1
1 · 2
+
1
2 · 3
+
1
3 · 4
+
1
4 · 5
+
1
5 · 6
=
5
6
The pattern seems to suggest the following formula:
1
1 · 2
+
1
2 · 3
+
1
3 · 4
+ · · · +
1
n(n + 1)
=
n
n + 1
(31)
We have verified that the formula is valid for n = 1, 2, 3, 4, 5. Now we
will use mathematical induction to prove that the formula (31) is valid
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
for every positive integer n.
Since the case n = 1 has been verified, we will proceed with the inductive
step. Assuming the formula (31) is valid for n = k:
1
1 · 2
+
1
2 · 3
+
1
3 · 4
+ · · · +
1
k(k + 1)
=
k
k + 1
, (32)
we will prove that (31) must be true for n = k + 1:
1
1 · 2
+
1
2 · 3
+
1
3 · 4
+ · · · +
1
(k + 1)(k + 2)
=
k + 1
k + 2
. (33)
The left-hand side of (33) can be written as
1
1 · 2
+
1
2 · 3
+
1
3 · 4
+ · · · +
1
k(k + 1)
+
1
(k + 1)(k + 2)
.
In view of (32), this simplifies to:
1
1 · 2
+
1
2 · 3
+
1
3 · 4
+ · · · +
1
k(k + 1)
+
1
(k + 1)(k + 2)
=
k
k + 1
+
1
(k + 1)(k + 2)
=
k(k + 2) + 1
(k + 1)(k + 2)
=
k2
+ 2k + 1
(k + 1)(k + 2)
=
(k + 1)2
(k + 1)(k + 2)
=
k + 1
k + 2
.
Thus the left-hand side of (33) is equal to the right-hand side of (33). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the formula (31) is valid for every positive integer n.
17. Find and verify a formula for the sum 1 + 3 + 5 + · · · + (2n − 1) of the
first n odd integers.
Solution: We can evaluate the sum for the first few values of n:
n = 1 : 1 = 1
n = 2 : 1 + 3 = 4
n = 3 : 1 + 3 + 5 = 9
n = 4 : 1 + 3 + 5 + 7 = 16
n = 5 : 1 + 3 + 5 + 7 + 9 = 25
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
The pattern seems to suggest the following formula:
1 + 3 + 5 + · · · + (2n − 1) = n2
. (34)
We have verified that the formula is valid for n = 1, 2, 3, 4, 5. Now we
will use mathematical induction to prove that the formula (34) is valid
for every positive integer n.
Since the case n = 1 has been verified, we will proceed with the inductive
step. Assuming the formula (34) is valid for n = k:
1 + 3 + 5 + · · · + (2k − 1) = k2
, (35)
we will prove that (34) must be true for n = k + 1:
1 + 3 + 5 + · · · + [2(k + 1) − 1] = (k + 1)2
. (36)
The left-hand side of (36) can be written as
1 + 3 + 5 + · · · + (2k − 1) + [2(k + 1) − 1].
In view of (35), this simplifies to:
[1 + 3 + 5 + · · · + (2k − 1)] + [2(k + 1) − 1] = k2
+ [2(k + 1) − 1]
= k2
+ 2k + 1
= (k + 1)2
.
Thus the left-hand side of (36) is equal to the right-hand side of (36). This
proves the inductive step. Therefore, by the principle of mathematical
induction, the formula (31) is valid for every positive integer n.
18. Prove that 7 divides 8n
− 1 for n ≥ 1.
Proof:
For n = 1, the statement claims that 7 divides 8 − 1. This is obviously
true.
Assuming the statement is true for n = k, i.e.,
8k
− 1 is divisible by 7 , (37)
we will prove that the statement must be true for n = k + 1:
8k+1
− 1 is divisible by 7. (38)
In order to make use of the inductive hypothesis (37), we can transform
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
the expression 8k+1
− 1 as follows:
8k+1
− 1 = 8 · 8k
− 1
= 8(8k
− 1) + 7.
The last expression must be divisible by 7 since, by the inductive hy-
pothesis, 8k
− 1 is divisible by 7, and obviously, 7 is divisible by 7. Thus
(38) holds and the inductive step is proved. Therefore, by the principle
of mathematical induction, the given statement is true for every positive
integer n.
19. Prove that 15 divides 42n
− 1 for n ≥ 1.
Proof:
For n = 1, the statement claims that 15 divides 42
− 1. This is obviously
true.
Assuming the statement is true for n = k, i.e.,
42k
− 1 is divisible by 15 , (39)
we will prove that the statement must be true for n = k + 1:
42(k+1)
− 1 is divisible by 15. (40)
In order to make use of the inductive hypothesis (39), we can transform
the expression 42(k+1)
− 1 as follows:
42(k+1)
− 1 = 42k+2
− 1
= 42
· 42k
− 1
= 16(42k
− 1) + 15.
The last expression must be divisible by 15 since, by the inductive hypoth-
esis, 42k
− 1 is divisible by 15, and obviously, 15 is divisible by 15. Thus
(40) holds and the inductive step is proved. Therefore, by the principle
of mathematical induction, the given statement is true for every positive
integer n.
20. Prove that 4 divides 3(72n
− 1) for n ≥ 1.
Proof:
For n = 1, the statement claims that 4 divides 3(72
− 1) = 144. This is
obviously true.
Assuming the statement is true for n = k, i.e.,
3(72k
− 1) is divisible by 4 , (41)
Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c
we will prove that the statement must be true for n = k + 1:
3 72(k+1)
− 1 is divisible by 4. (42)
In order to make use of the inductive hypothesis (41), we can transform
the expression 3 72(k+1)
− 1 as follows:
3 72(k+1)
− 1 = 3 72k+2
− 1
= 3 72
· 72k
− 1
= 3 49(72k
− 1) + 48
= 147(72k
− 1) + 144.
The last expression must be divisible by 4 since, by the inductive hypoth-
esis, 42k
− 1 is divisible by 4, and obviously, 144 is divisible by 4. Thus
(42) holds and the inductive step is proved. Therefore, by the principle
of mathematical induction, the given statement is true for every positive
integer n.
21. Prove that 5 divides 42n
− 1 for n ≥ 1.
Proof:
For n = 1, the statement claims that 5 divides 42
− 1 = 15. This is
obviously true.
Assuming the statement is true for n = k, i.e.,
42k
− 1 is divisible by 5 , (43)
we will prove that the statement must be true for n = k + 1:
42(k+1)
− 1 is divisible by 5. (44)
In order to make use of the inductive hypothesis (43), we can transform
the expression 42(k+1)
− 1 as follows:
42(k+1)
− 1 = 42k+2
− 1
= 42
· 42k
− 1
= 16(42k
− 1) + 15.
The last expression must be divisible by 5 since, by the inductive hypoth-
esis, 42k
− 1 is divisible by 5, and obviously, 15 is divisible by 5. Thus
(44) holds and the inductive step is proved. Therefore, by the principle
of mathematical induction, the given statement is true for every positive
integer n.

Weitere ähnliche Inhalte

Was ist angesagt?

a decomposition methodMin quasdratic.pdf
a decomposition methodMin quasdratic.pdfa decomposition methodMin quasdratic.pdf
a decomposition methodMin quasdratic.pdfAnaRojas146538
 
Novel Performance Analysis of Network Coded Communications in Single-Relay Ne...
Novel Performance Analysis of Network Coded Communications in Single-Relay Ne...Novel Performance Analysis of Network Coded Communications in Single-Relay Ne...
Novel Performance Analysis of Network Coded Communications in Single-Relay Ne...Communication Systems & Networks
 
Hamiltonian Chromatic Number of Graphs
Hamiltonian Chromatic Number of GraphsHamiltonian Chromatic Number of Graphs
Hamiltonian Chromatic Number of GraphsIJERA Editor
 
IIT JAM MATH 2021 Question Paper | Sourav Sir's Classes
IIT JAM MATH 2021 Question Paper | Sourav Sir's ClassesIIT JAM MATH 2021 Question Paper | Sourav Sir's Classes
IIT JAM MATH 2021 Question Paper | Sourav Sir's ClassesSOURAV DAS
 
IIT JAM MATH 2020 Question Paper | Sourav Sir's Classes
IIT JAM MATH 2020 Question Paper | Sourav Sir's ClassesIIT JAM MATH 2020 Question Paper | Sourav Sir's Classes
IIT JAM MATH 2020 Question Paper | Sourav Sir's ClassesSOURAV DAS
 
Numerical analysis stationary variables
Numerical analysis  stationary variablesNumerical analysis  stationary variables
Numerical analysis stationary variablesSHAMJITH KM
 
Chapter-4: More on Direct Proof and Proof by Contrapositive
Chapter-4: More on Direct Proof and Proof by ContrapositiveChapter-4: More on Direct Proof and Proof by Contrapositive
Chapter-4: More on Direct Proof and Proof by Contrapositivenszakir
 
IIT JAM MATH 2019 Question Paper | Sourav Sir's Classes
IIT JAM MATH 2019 Question Paper | Sourav Sir's ClassesIIT JAM MATH 2019 Question Paper | Sourav Sir's Classes
IIT JAM MATH 2019 Question Paper | Sourav Sir's ClassesSOURAV DAS
 
Chapter 9 differentiation
Chapter 9  differentiationChapter 9  differentiation
Chapter 9 differentiationatiqah ayie
 
5.2 divede and conquer 03
5.2 divede and conquer 035.2 divede and conquer 03
5.2 divede and conquer 03Krish_ver2
 
FEM Introduction: Solving ODE-BVP using the Galerkin's Method
FEM Introduction: Solving ODE-BVP using the Galerkin's MethodFEM Introduction: Solving ODE-BVP using the Galerkin's Method
FEM Introduction: Solving ODE-BVP using the Galerkin's MethodSuddhasheel GHOSH, PhD
 
Prime numbers boundary
Prime numbers boundary Prime numbers boundary
Prime numbers boundary Camilo Ulloa
 
New Families of Odd Harmonious Graphs
New Families of Odd Harmonious GraphsNew Families of Odd Harmonious Graphs
New Families of Odd Harmonious GraphsIJMIT JOURNAL
 

Was ist angesagt? (19)

a decomposition methodMin quasdratic.pdf
a decomposition methodMin quasdratic.pdfa decomposition methodMin quasdratic.pdf
a decomposition methodMin quasdratic.pdf
 
Novel Performance Analysis of Network Coded Communications in Single-Relay Ne...
Novel Performance Analysis of Network Coded Communications in Single-Relay Ne...Novel Performance Analysis of Network Coded Communications in Single-Relay Ne...
Novel Performance Analysis of Network Coded Communications in Single-Relay Ne...
 
Fungsi rekursiv
Fungsi rekursivFungsi rekursiv
Fungsi rekursiv
 
E content on algebra & trignomentry
E content on algebra & trignomentryE content on algebra & trignomentry
E content on algebra & trignomentry
 
Improper integral
Improper integralImproper integral
Improper integral
 
Hamiltonian Chromatic Number of Graphs
Hamiltonian Chromatic Number of GraphsHamiltonian Chromatic Number of Graphs
Hamiltonian Chromatic Number of Graphs
 
Some New Prime Graphs
Some New Prime GraphsSome New Prime Graphs
Some New Prime Graphs
 
IIT JAM MATH 2021 Question Paper | Sourav Sir's Classes
IIT JAM MATH 2021 Question Paper | Sourav Sir's ClassesIIT JAM MATH 2021 Question Paper | Sourav Sir's Classes
IIT JAM MATH 2021 Question Paper | Sourav Sir's Classes
 
IIT JAM MATH 2020 Question Paper | Sourav Sir's Classes
IIT JAM MATH 2020 Question Paper | Sourav Sir's ClassesIIT JAM MATH 2020 Question Paper | Sourav Sir's Classes
IIT JAM MATH 2020 Question Paper | Sourav Sir's Classes
 
Numerical analysis stationary variables
Numerical analysis  stationary variablesNumerical analysis  stationary variables
Numerical analysis stationary variables
 
Chapter-4: More on Direct Proof and Proof by Contrapositive
Chapter-4: More on Direct Proof and Proof by ContrapositiveChapter-4: More on Direct Proof and Proof by Contrapositive
Chapter-4: More on Direct Proof and Proof by Contrapositive
 
IIT JAM MATH 2019 Question Paper | Sourav Sir's Classes
IIT JAM MATH 2019 Question Paper | Sourav Sir's ClassesIIT JAM MATH 2019 Question Paper | Sourav Sir's Classes
IIT JAM MATH 2019 Question Paper | Sourav Sir's Classes
 
Chapter 9 differentiation
Chapter 9  differentiationChapter 9  differentiation
Chapter 9 differentiation
 
Bayes gauss
Bayes gaussBayes gauss
Bayes gauss
 
5.2 divede and conquer 03
5.2 divede and conquer 035.2 divede and conquer 03
5.2 divede and conquer 03
 
FEM Introduction: Solving ODE-BVP using the Galerkin's Method
FEM Introduction: Solving ODE-BVP using the Galerkin's MethodFEM Introduction: Solving ODE-BVP using the Galerkin's Method
FEM Introduction: Solving ODE-BVP using the Galerkin's Method
 
Equivariance
EquivarianceEquivariance
Equivariance
 
Prime numbers boundary
Prime numbers boundary Prime numbers boundary
Prime numbers boundary
 
New Families of Odd Harmonious Graphs
New Families of Odd Harmonious GraphsNew Families of Odd Harmonious Graphs
New Families of Odd Harmonious Graphs
 

Ähnlich wie Text s1 21

Mathematical Induction
Mathematical InductionMathematical Induction
Mathematical InductionEdelyn Cagas
 
Further mathematics notes zimsec cambridge zimbabwe
Further mathematics notes zimsec cambridge zimbabweFurther mathematics notes zimsec cambridge zimbabwe
Further mathematics notes zimsec cambridge zimbabweAlpro
 
A Recurrence Relation With
A Recurrence Relation WithA Recurrence Relation With
A Recurrence Relation WithJasmine Dixon
 
Mock cat solutions paper no 1
Mock cat solutions paper no 1Mock cat solutions paper no 1
Mock cat solutions paper no 1Vandan Kashyap
 
aads_assignment2_answer.pdf
aads_assignment2_answer.pdfaads_assignment2_answer.pdf
aads_assignment2_answer.pdfNanaKoori
 
sample-paper-class-12-maths-solution.pdf
sample-paper-class-12-maths-solution.pdfsample-paper-class-12-maths-solution.pdf
sample-paper-class-12-maths-solution.pdfAnuBajpai5
 
Maths-MS_Term2 (1).pdf
Maths-MS_Term2 (1).pdfMaths-MS_Term2 (1).pdf
Maths-MS_Term2 (1).pdfAnuBajpai5
 
Maths-MS_Term2.pdf
Maths-MS_Term2.pdfMaths-MS_Term2.pdf
Maths-MS_Term2.pdfAnuBajpai5
 
MATHEMATICS XI TEST PAPER SOL.pdf
MATHEMATICS XI TEST PAPER SOL.pdfMATHEMATICS XI TEST PAPER SOL.pdf
MATHEMATICS XI TEST PAPER SOL.pdfAshwani Jha
 
SMB_2012_HR_VAN_ST-last version
SMB_2012_HR_VAN_ST-last versionSMB_2012_HR_VAN_ST-last version
SMB_2012_HR_VAN_ST-last versionLilyana Vankova
 
Mathematical induction
Mathematical inductionMathematical induction
Mathematical inductionSman Abbasi
 
differential-calculus-1-23.pdf
differential-calculus-1-23.pdfdifferential-calculus-1-23.pdf
differential-calculus-1-23.pdfIILSASTOWER
 
Analysis Of Algorithms Ii
Analysis Of Algorithms IiAnalysis Of Algorithms Ii
Analysis Of Algorithms IiSri Prasanna
 
Rosser's theorem
Rosser's theoremRosser's theorem
Rosser's theoremWathna
 

Ähnlich wie Text s1 21 (20)

Mathematical Induction
Mathematical InductionMathematical Induction
Mathematical Induction
 
Further mathematics notes zimsec cambridge zimbabwe
Further mathematics notes zimsec cambridge zimbabweFurther mathematics notes zimsec cambridge zimbabwe
Further mathematics notes zimsec cambridge zimbabwe
 
Induction q
Induction qInduction q
Induction q
 
Induction q
Induction qInduction q
Induction q
 
A Recurrence Relation With
A Recurrence Relation WithA Recurrence Relation With
A Recurrence Relation With
 
Mock cat solutions paper no 1
Mock cat solutions paper no 1Mock cat solutions paper no 1
Mock cat solutions paper no 1
 
Sample question paper 2 with solution
Sample question paper 2 with solutionSample question paper 2 with solution
Sample question paper 2 with solution
 
FUNÇÃO EXPONENCIAL E LOGARÍTMICA
FUNÇÃO EXPONENCIAL E LOGARÍTMICAFUNÇÃO EXPONENCIAL E LOGARÍTMICA
FUNÇÃO EXPONENCIAL E LOGARÍTMICA
 
aads_assignment2_answer.pdf
aads_assignment2_answer.pdfaads_assignment2_answer.pdf
aads_assignment2_answer.pdf
 
sample-paper-class-12-maths-solution.pdf
sample-paper-class-12-maths-solution.pdfsample-paper-class-12-maths-solution.pdf
sample-paper-class-12-maths-solution.pdf
 
Maths-MS_Term2 (1).pdf
Maths-MS_Term2 (1).pdfMaths-MS_Term2 (1).pdf
Maths-MS_Term2 (1).pdf
 
Maths-MS_Term2.pdf
Maths-MS_Term2.pdfMaths-MS_Term2.pdf
Maths-MS_Term2.pdf
 
MATHEMATICS XI TEST PAPER SOL.pdf
MATHEMATICS XI TEST PAPER SOL.pdfMATHEMATICS XI TEST PAPER SOL.pdf
MATHEMATICS XI TEST PAPER SOL.pdf
 
SMB_2012_HR_VAN_ST-last version
SMB_2012_HR_VAN_ST-last versionSMB_2012_HR_VAN_ST-last version
SMB_2012_HR_VAN_ST-last version
 
Mathematical induction
Mathematical inductionMathematical induction
Mathematical induction
 
Para mayra
Para mayraPara mayra
Para mayra
 
differential-calculus-1-23.pdf
differential-calculus-1-23.pdfdifferential-calculus-1-23.pdf
differential-calculus-1-23.pdf
 
Analysis Of Algorithms Ii
Analysis Of Algorithms IiAnalysis Of Algorithms Ii
Analysis Of Algorithms Ii
 
Rosser's theorem
Rosser's theoremRosser's theorem
Rosser's theorem
 
Imc2017 day1-solutions
Imc2017 day1-solutionsImc2017 day1-solutions
Imc2017 day1-solutions
 

Kürzlich hochgeladen

Upgrade Your Banking Experience with Advanced Core Banking Applications
Upgrade Your Banking Experience with Advanced Core Banking ApplicationsUpgrade Your Banking Experience with Advanced Core Banking Applications
Upgrade Your Banking Experience with Advanced Core Banking ApplicationsIntellect Design Arena Ltd
 
Live-Streaming in the Music Industry Webinar
Live-Streaming in the Music Industry WebinarLive-Streaming in the Music Industry Webinar
Live-Streaming in the Music Industry WebinarNathanielSchmuck
 
Mihir Menda - Member of Supervisory Board at RMZ
Mihir Menda - Member of Supervisory Board at RMZMihir Menda - Member of Supervisory Board at RMZ
Mihir Menda - Member of Supervisory Board at RMZKanakChauhan5
 
Plano de marketing- inglês em formato ppt
Plano de marketing- inglês  em formato pptPlano de marketing- inglês  em formato ppt
Plano de marketing- inglês em formato pptElizangelaSoaresdaCo
 
A flour, rice and Suji company in Jhang.
A flour, rice and Suji company in Jhang.A flour, rice and Suji company in Jhang.
A flour, rice and Suji company in Jhang.mcshagufta46
 
HELENE HECKROTTE'S PROFESSIONAL PORTFOLIO.pptx
HELENE HECKROTTE'S PROFESSIONAL PORTFOLIO.pptxHELENE HECKROTTE'S PROFESSIONAL PORTFOLIO.pptx
HELENE HECKROTTE'S PROFESSIONAL PORTFOLIO.pptxHelene Heckrotte
 
The Vietnam Believer Newsletter_MARCH 25, 2024_EN_Vol. 003
The Vietnam Believer Newsletter_MARCH 25, 2024_EN_Vol. 003The Vietnam Believer Newsletter_MARCH 25, 2024_EN_Vol. 003
The Vietnam Believer Newsletter_MARCH 25, 2024_EN_Vol. 003believeminhh
 
Building Your Personal Brand on LinkedIn - Expert Planet- 2024
 Building Your Personal Brand on LinkedIn - Expert Planet-  2024 Building Your Personal Brand on LinkedIn - Expert Planet-  2024
Building Your Personal Brand on LinkedIn - Expert Planet- 2024Stephan Koning
 
MoneyBridge Pitch Deck - Investor Presentation
MoneyBridge Pitch Deck - Investor PresentationMoneyBridge Pitch Deck - Investor Presentation
MoneyBridge Pitch Deck - Investor Presentationbaron83
 
Borderless Access - Global Panel book-unlock 2024
Borderless Access - Global Panel book-unlock 2024Borderless Access - Global Panel book-unlock 2024
Borderless Access - Global Panel book-unlock 2024Borderless Access
 
To Create Your Own Wig Online To Create Your Own Wig Online
To Create Your Own Wig Online  To Create Your Own Wig OnlineTo Create Your Own Wig Online  To Create Your Own Wig Online
To Create Your Own Wig Online To Create Your Own Wig Onlinelng ths
 
Harvard Business Review.pptx | Navigating Labor Unrest (March-April 2024)
Harvard Business Review.pptx | Navigating Labor Unrest (March-April 2024)Harvard Business Review.pptx | Navigating Labor Unrest (March-April 2024)
Harvard Business Review.pptx | Navigating Labor Unrest (March-April 2024)tazeenaila12
 
Fabric RFID Wristbands in Ireland for Events and Festivals
Fabric RFID Wristbands in Ireland for Events and FestivalsFabric RFID Wristbands in Ireland for Events and Festivals
Fabric RFID Wristbands in Ireland for Events and FestivalsWristbands Ireland
 
Slicing Work on Business Agility Meetup Berlin
Slicing Work on Business Agility Meetup BerlinSlicing Work on Business Agility Meetup Berlin
Slicing Work on Business Agility Meetup BerlinAnton Skornyakov
 
PDT 89 - $1.4M - Seed - Plantee Innovations.pdf
PDT 89 - $1.4M - Seed - Plantee Innovations.pdfPDT 89 - $1.4M - Seed - Plantee Innovations.pdf
PDT 89 - $1.4M - Seed - Plantee Innovations.pdfHajeJanKamps
 
UNLEASHING THE POWER OF PROGRAMMATIC ADVERTISING
UNLEASHING THE POWER OF PROGRAMMATIC ADVERTISINGUNLEASHING THE POWER OF PROGRAMMATIC ADVERTISING
UNLEASHING THE POWER OF PROGRAMMATIC ADVERTISINGlokeshwarmaha
 
PDT 88 - 4 million seed - Seed - Protecto.pdf
PDT 88 - 4 million seed - Seed - Protecto.pdfPDT 88 - 4 million seed - Seed - Protecto.pdf
PDT 88 - 4 million seed - Seed - Protecto.pdfHajeJanKamps
 
Developing Coaching Skills: Mine, Yours, Ours
Developing Coaching Skills: Mine, Yours, OursDeveloping Coaching Skills: Mine, Yours, Ours
Developing Coaching Skills: Mine, Yours, OursKaiNexus
 
Introduction to The overview of GAAP LO 1-5.pptx
Introduction to The overview of GAAP LO 1-5.pptxIntroduction to The overview of GAAP LO 1-5.pptx
Introduction to The overview of GAAP LO 1-5.pptxJemalSeid25
 
Team B Mind Map for Organizational Chg..
Team B Mind Map for Organizational Chg..Team B Mind Map for Organizational Chg..
Team B Mind Map for Organizational Chg..dlewis191
 

Kürzlich hochgeladen (20)

Upgrade Your Banking Experience with Advanced Core Banking Applications
Upgrade Your Banking Experience with Advanced Core Banking ApplicationsUpgrade Your Banking Experience with Advanced Core Banking Applications
Upgrade Your Banking Experience with Advanced Core Banking Applications
 
Live-Streaming in the Music Industry Webinar
Live-Streaming in the Music Industry WebinarLive-Streaming in the Music Industry Webinar
Live-Streaming in the Music Industry Webinar
 
Mihir Menda - Member of Supervisory Board at RMZ
Mihir Menda - Member of Supervisory Board at RMZMihir Menda - Member of Supervisory Board at RMZ
Mihir Menda - Member of Supervisory Board at RMZ
 
Plano de marketing- inglês em formato ppt
Plano de marketing- inglês  em formato pptPlano de marketing- inglês  em formato ppt
Plano de marketing- inglês em formato ppt
 
A flour, rice and Suji company in Jhang.
A flour, rice and Suji company in Jhang.A flour, rice and Suji company in Jhang.
A flour, rice and Suji company in Jhang.
 
HELENE HECKROTTE'S PROFESSIONAL PORTFOLIO.pptx
HELENE HECKROTTE'S PROFESSIONAL PORTFOLIO.pptxHELENE HECKROTTE'S PROFESSIONAL PORTFOLIO.pptx
HELENE HECKROTTE'S PROFESSIONAL PORTFOLIO.pptx
 
The Vietnam Believer Newsletter_MARCH 25, 2024_EN_Vol. 003
The Vietnam Believer Newsletter_MARCH 25, 2024_EN_Vol. 003The Vietnam Believer Newsletter_MARCH 25, 2024_EN_Vol. 003
The Vietnam Believer Newsletter_MARCH 25, 2024_EN_Vol. 003
 
Building Your Personal Brand on LinkedIn - Expert Planet- 2024
 Building Your Personal Brand on LinkedIn - Expert Planet-  2024 Building Your Personal Brand on LinkedIn - Expert Planet-  2024
Building Your Personal Brand on LinkedIn - Expert Planet- 2024
 
MoneyBridge Pitch Deck - Investor Presentation
MoneyBridge Pitch Deck - Investor PresentationMoneyBridge Pitch Deck - Investor Presentation
MoneyBridge Pitch Deck - Investor Presentation
 
Borderless Access - Global Panel book-unlock 2024
Borderless Access - Global Panel book-unlock 2024Borderless Access - Global Panel book-unlock 2024
Borderless Access - Global Panel book-unlock 2024
 
To Create Your Own Wig Online To Create Your Own Wig Online
To Create Your Own Wig Online  To Create Your Own Wig OnlineTo Create Your Own Wig Online  To Create Your Own Wig Online
To Create Your Own Wig Online To Create Your Own Wig Online
 
Harvard Business Review.pptx | Navigating Labor Unrest (March-April 2024)
Harvard Business Review.pptx | Navigating Labor Unrest (March-April 2024)Harvard Business Review.pptx | Navigating Labor Unrest (March-April 2024)
Harvard Business Review.pptx | Navigating Labor Unrest (March-April 2024)
 
Fabric RFID Wristbands in Ireland for Events and Festivals
Fabric RFID Wristbands in Ireland for Events and FestivalsFabric RFID Wristbands in Ireland for Events and Festivals
Fabric RFID Wristbands in Ireland for Events and Festivals
 
Slicing Work on Business Agility Meetup Berlin
Slicing Work on Business Agility Meetup BerlinSlicing Work on Business Agility Meetup Berlin
Slicing Work on Business Agility Meetup Berlin
 
PDT 89 - $1.4M - Seed - Plantee Innovations.pdf
PDT 89 - $1.4M - Seed - Plantee Innovations.pdfPDT 89 - $1.4M - Seed - Plantee Innovations.pdf
PDT 89 - $1.4M - Seed - Plantee Innovations.pdf
 
UNLEASHING THE POWER OF PROGRAMMATIC ADVERTISING
UNLEASHING THE POWER OF PROGRAMMATIC ADVERTISINGUNLEASHING THE POWER OF PROGRAMMATIC ADVERTISING
UNLEASHING THE POWER OF PROGRAMMATIC ADVERTISING
 
PDT 88 - 4 million seed - Seed - Protecto.pdf
PDT 88 - 4 million seed - Seed - Protecto.pdfPDT 88 - 4 million seed - Seed - Protecto.pdf
PDT 88 - 4 million seed - Seed - Protecto.pdf
 
Developing Coaching Skills: Mine, Yours, Ours
Developing Coaching Skills: Mine, Yours, OursDeveloping Coaching Skills: Mine, Yours, Ours
Developing Coaching Skills: Mine, Yours, Ours
 
Introduction to The overview of GAAP LO 1-5.pptx
Introduction to The overview of GAAP LO 1-5.pptxIntroduction to The overview of GAAP LO 1-5.pptx
Introduction to The overview of GAAP LO 1-5.pptx
 
Team B Mind Map for Organizational Chg..
Team B Mind Map for Organizational Chg..Team B Mind Map for Organizational Chg..
Team B Mind Map for Organizational Chg..
 

Text s1 21

  • 1. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c In Exercises 1-15 use mathematical induction to establish the formula for n ≥ 1. 1. 12 + 22 + 32 + · · · + n2 = n(n + 1)(2n + 1) 6 Proof: For n = 1, the statement reduces to 12 = 1 · 2 · 3 6 and is obviously true. Assuming the statement is true for n = k: 12 + 22 + 32 + · · · + k2 = k(k + 1)(2k + 1) 6 , (1) we will prove that the statement must be true for n = k + 1: 12 + 22 + 32 + · · · + (k + 1)2 = (k + 1)(k + 2)(2k + 3) 6 . (2) The left-hand side of (2) can be written as 12 + 22 + 32 + · · · + k2 + (k + 1)2 . In view of (1), this simplifies to: 12 + 22 + 32 + · · · + k2 + (k + 1)2 = k(k + 1)(2k + 1) 6 + (k + 1)2 = k(k + 1)(2k + 1) + 6(k + 1)2 6 = (k + 1)[k(2k + 1) + 6(k + 1)] 6 = (k + 1)(2k2 + 7k + 6) 6 = (k + 1)(k + 2)(2k + 3) 6 . Thus the left-hand side of (2) is equal to the right-hand side of (2). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 2. 3 + 32 + 33 + · · · + 3n = 3n+1 − 3 2 Proof: For n = 1, the statement reduces to 3 = 32 − 3 2 and is obviously true. Assuming the statement is true for n = k: 3 + 32 + 33 + · · · + 3k = 3k+1 − 3 2 , (3) we will prove that the statement must be true for n = k + 1: 3 + 32 + 33 + · · · + 3k+1 = 3k+2 − 3 2 . (4)
  • 2. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c The left-hand side of (4) can be written as 3 + 32 + 33 + · · · + 3k + 3k+1 . In view of (3), this simplifies to: 3 + 32 + 33 + · · · + 3k + 3k+1 = 3k+1 − 3 2 + 3k+1 = 3k+1 − 3 + 2 · 3k+1 2 = 3 · 3k+1 − 3 2 = 3k+2 − 3 2 . Thus the left-hand side of (4) is equal to the right-hand side of (4). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 3. 13 + 23 + 33 + · · · + n3 = n2 (n + 1)2 4 Proof: For n = 1, the statement reduces to 13 = 12 · 22 4 and is obviously true. Assuming the statement is true for n = k: 13 + 23 + 33 + · · · + k3 = k2 (k + 1)2 4 , (5) we will prove that the statement must be true for n = k + 1: 13 + 23 + 33 + · · · + (k + 1)3 = (k + 1)2 (k + 2)2 4 . (6) The left-hand side of (6) can be written as 13 + 23 + 33 + · · · + k3 + (k + 1)3 . In view of (5), this simplifies to: 13 + 23 + 33 + · · · + k3 + (k + 1)3 = k2 (k + 1)2 4 + (k + 1)3 = k2 (k + 1)2 + 4(k + 1)3 4 = (k + 1)2 [k2 + 4(k + 1)] 4 = (k + 1)2 (k + 2)2 4 . Thus the left-hand side of (6) is equal to the right-hand side of (6). This proves the inductive step. Therefore, by the principle of mathematical
  • 3. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c induction, the given statement is true for every positive integer n. 4. 1 + 3 + 6 + 10 + · · · + n(n + 1) 2 = n(n + 1)(n + 2) 6 Proof: For n = 1, the statement reduces to 1 = 1 · 2 · 3 6 and is obviously true. Assuming the statement is true for n = k: 1 + 3 + 6 + 10 + · · · + k(k + 1) 2 = k(k + 1)(k + 2) 6 , (7) we will prove that the statement must be true for n = k + 1: 1 + 3 + 6 + 10 + · · · + (k + 1)(k + 2) 2 = (k + 1)(k + 2)(k + 3) 6 . (8) The left-hand side of (8) can be written as 1 + 3 + 6 + 10 + · · · + k(k + 1) 2 + (k + 1)(k + 2) 2 . In view of (7), this simplifies to: 1 + 3 + 6 + 10 + · · · + k(k + 1) 2 + (k + 1)(k + 2) 2 = k(k + 1)(k + 2) 6 + (k + 1)(k + 2) 2 = k(k + 1)(k + 2) + 3(k + 1)(k + 2) 6 = (k + 1)(k + 2)(k + 3) 6 . Thus the left-hand side of (8) is equal to the right-hand side of (8). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 5. 1 + 4 + 7 + · · · + (3n − 2) = n(3n − 1) 2 Proof: For n = 1, the statement reduces to 1 = 1 · 2 2 and is obviously true. Assuming the statement is true for n = k: 1 + 4 + 7 + · · · + (3k − 2) = k(3k − 1) 2 , (9) we will prove that the statement must be true for n = k + 1: 1 + 4 + 7 + · · · + [3(k + 1) − 2] = (k + 1)[3(k + 1) − 1] 2 . (10)
  • 4. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c The left-hand side of (10) can be written as 1 + 4 + 7 + · · · + (3k − 2) + [3(k + 1) − 2]. In view of (9), this simplifies to: [1 + 4 + 7 + · · · + (3k − 2)] + (3k + 1) = k(3k − 1) 2 + (3k + 1) = k(3k − 1) + 2(3k + 1) 2 = 3k2 + 5k + 2 2 = (k + 1)(3k + 2) 2 . The last expression is obviously equal to the right-hand side of (10). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 6. 12 + 32 + 52 + · · · + (2n − 1)2 = n(2n − 1)(2n + 1) 3 Proof: For n = 1, the statement reduces to 12 = 1 · 3 · 3 3 and is obviously true. Assuming the statement is true for n = k: 12 + 32 + 52 + · · · + (2k − 1)2 = k(2k − 1)(2k + 1) 3 , (11) we will prove that the statement must be true for n = k + 1: 12 + 32 + 52 + · · · + [2(k + 1) − 1]2 = (k + 1)[2(k + 1) − 1][2(k + 1) + 1] 3 . (12) The left-hand side of (12) can be written as 12 + 32 + 52 + · · · + (2k − 1)2 + [2(k + 1) − 1]2 . In view of (11), this simplifies to:
  • 5. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c 12 + 32 + 52 + · · · + (2k − 1)2 + (2k + 1)2 = k(2k − 1)(2k + 1) 3 + (2k + 1)2 = k(2k − 1)(2k + 1) + 3(2k + 1)2 3 = (2k + 1)[k(2k − 1) + 3(2k + 1)] 3 = (2k + 1)(2k2 + 5k + 3) 3 = (2k + 1)(k + 1)(2k + 3) 3 = (k + 1)[2(k + 1) − 1][2(k + 1) + 1] 3 . Thus the left-hand side of (12) is equal to the right-hand side of (12). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 7. 1 + 5 + 9 + 13 + · · · + (4n − 3) = 2n2 − n Proof: For n = 1, the statement reduces to 1 = 2 · 12 − 1 and is obviously true. Assuming the statement is true for n = k: 1 + 5 + 9 + 13 + · · · + (4k − 3) = 2k2 − k , (13) we will prove that the statement must be true for n = k + 1: 1 + 5 + 9 + 13 + · · · + [4(k + 1) − 3] = 2(k + 1)2 − (k + 1) . (14) The left-hand side of (14) can be written as 1 + 5 + 9 + 13 + · · · + (4k − 3) + [4(k + 1) − 3]. In view of (13), this simplifies to: [1 + 5 + 9 + 13 · · · + (4k − 3)] + (4k + 1) = (2k2 − k) + (4k + 1) = 2k2 + 3k + 1 = (k + 1)(2k + 1) = (k + 1)[2(k + 1) − 1] = 2(k + 1)2 − (k + 1). Thus the left-hand side of (14) is equal to the right-hand side of (14). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n.
  • 6. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c 8. 2 + 23 + 25 + · · · + 22n−1 = 2(22n − 1) 3 Proof: For n = 1, the statement reduces to 2 = 2(22 − 1) 3 and is obviously true. Assuming the statement is true for n = k: 2 + 23 + 25 + · · · + 22k−1 = 2(22k − 1) 3 , (15) we will prove that the statement must be true for n = k + 1: 2 + 23 + 25 + · · · + 22(k+1)−1 = 2(22(k+1) − 1) 3 . (16) The left-hand side of (16) can be written as 2 + 23 + 25 + · · · + 22k−1 + 22(k+1)−1 . In view of (15), this simplifies to: 2 + 23 + 25 + · · · + 22k−1 + 22k+1 = 2(22k − 1) 3 + 22k+1 = 2(22k − 1) + 3 · 22k+1 3 = 22k+1 − 2 + 3 · 22k+1 3 = 4 · 22k+1 − 2 3 = 2(2 · 22k+1 − 1) 3 = 2(22k+2 − 1) 3 . The last expression is obviously equal to the right-hand side of (16). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 9. 1 1 · 2 · 3 + 1 2 · 3 · 4 + 1 3 · 4 · 5 + · · · + 1 n(n + 1)(n + 2) = n(n + 3) 4(n + 1)(n + 2) Proof: For n = 1, the statement reduces to 1 1 · 2 · 3 = 1 · 4 4 · 2 · 3 and is obviously true. Assuming the statement is true for n = k: 1 1 · 2 · 3 + 1 2 · 3 · 4 + 1 3 · 4 · 5 + · · · + 1 k(k + 1)(k + 2) = k(k + 3) 4(k + 1)(k + 2) , (17)
  • 7. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c we will prove that the statement must be true for n = k + 1: 1 1 · 2 · 3 + 1 2 · 3 · 4 + 1 3 · 4 · 5 +· · ·+ 1 (k + 1)(k + 2)(k + 3) = (k + 1)(k + 4) 4(k + 2)(k + 3) . (18) The left-hand side of (18) can be written as 1 1 · 2 · 3 + 1 2 · 3 · 4 + 1 3 · 4 · 5 +· · ·+ 1 k(k + 1)(k + 2) + 1 (k + 1)(k + 2)(k + 3) . In view of (17), this simplifies to: 1 1 · 2 · 3 + 1 2 · 3 · 4 + 1 3 · 4 · 5 + · · · + 1 k(k + 1)(k + 2) + 1 (k + 1)(k + 2)(k + 3) = k(k + 3) 4(k + 1)(k + 2) + 1 (k + 1)(k + 2)(k + 3) = k(k + 3)2 + 4 4(k + 1)(k + 2)(k + 3) = k(k2 + 6k + 9) + 4 4(k + 1)(k + 2)(k + 3) = k3 + 6k2 + 9k + 4 4(k + 1)(k + 2)(k + 3) = (k + 1)(k2 + 5k + 4) 4(k + 1)(k + 2)(k + 3) = k2 + 5k + 4 4(k + 2)(k + 3) = (k + 1)(k + 4) 4(k + 2)(k + 3) . Thus the left-hand side of (18) is equal to the right-hand side of (18). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 10. 43 + 83 + 123 + · · · + (4n)3 = 16n2 (n + 1)2 Proof: For n = 1, the statement reduces to 43 = 16 · 12 · 22 and is obviously true. Assuming the statement is true for n = k: 43 + 83 + 123 + · · · + (4k)3 = 16k2 (k + 1)2 , (19) we will prove that the statement must be true for n = k + 1: 43 + 83 + 123 + · · · + [4(k + 1)]3 = 16(k + 1)2 (k + 2)2 . (20) The left-hand side of (20) can be written as 43 + 83 + 123 + · · · + (4k)3 + [4(k + 1)]3 .
  • 8. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c In view of (19), this simplifies to: 43 + 83 + 123 + · · · + (4k)3 + 43 (k + 1)3 = 16k2 (k + 1)2 + 64(k + 1)3 = 16(k + 1)2 [k2 + 4(k + 1)] = 16(k + 1)2 (k + 2)2 . Thus the left-hand side of (20) is equal to the right-hand side of (20). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 11. 1 52 + 1 54 + · · · + 1 52n = 1 24 1 − 1 25n Proof: For n = 1, the statement reduces to 1 52 = 1 24 1 − 1 25 . This is equivalent to 1 25 = 1 24 · 24 25 and is obviously true. Assuming the statement is true for n = k: 1 52 + 1 54 + · · · + 1 52k = 1 24 1 − 1 25k , (21) we will prove that the statement must be true for n = k + 1: 1 52 + 1 54 + · · · + 1 52(k+1) = 1 24 1 − 1 25k+1 . (22) The left-hand side of (22) can be written as 1 52 + 1 54 + · · · + 1 52k + 1 52(k+1) . In view of (21), this simplifies to: 1 52 + 1 54 + · · · + 1 52k + 1 52(k+1) = 1 24 1 − 1 25k + 1 52(k+1) = 25k − 1 24 · 25k + 1 25k+1 = 25(25k − 1) + 24 24 · 25k+1 = 25k+1 − 25 + 24 24 · 25k+1 = 1 24 · 25k+1 − 1 25k+1 = 1 24 1 − 1 25k+1 . Thus the left-hand side of (22) is equal to the right-hand side of (22). This proves the inductive step. Therefore, by the principle of mathematical
  • 9. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c induction, the given statement is true for every positive integer n. 12. 2−1 + 2−2 + 2−3 + · · · + 2−n = 1 − 2−n Proof: For n = 1, the statement reduces to 2−1 = 1 − 2−1 and is obviously true. Assuming the statement is true for n = k: 2−1 + 2−2 + 2−3 + · · · + 2−k = 1 − 2−k , (23) we will prove that the statement must be true for n = k + 1: 2−1 + 2−2 + 2−3 + · · · + 2−(k+1) = 1 − 2−(k+1) . (24) The left-hand side of (24) can be written as 2−1 + 2−2 + 2−3 + · · · + 2−k + 2−(k+1) . In view of (23), this simplifies to: 2−1 + 2−2 + 2−3 + · · · + 2−k + 2−(k+1) = 1 − 2−k + 2−(k+1) = 1 − 2 · 2−(k+1) + 2−(k+1) = 1 − 2−(k+1) . Thus the left-hand side of (24) is equal to the right-hand side of (24). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 13. 1 · 2 + 2 · 3 + 3 · 4 + · · · + n(n + 1) = n(n + 1)(n + 2) 3 Proof: For n = 1, the statement reduces to 1 · 2 = 1 · 2 · 3 3 and is obviously true. Assuming the statement is true for n = k: 1 · 2 + 2 · 3 + 3 · 4 + · · · + k(k + 1) = k(k + 1)(k + 2) 3 , (25) we will prove that the statement must be true for n = k + 1: 1 · 2 + 2 · 3 + 3 · 4 + · · · + (k + 1)(k + 2) = (k + 1)(k + 2)(k + 3) 3 . (26) The left-hand side of (26) can be written as 1 · 2 + 2 · 3 + 3 · 4 + · · · + k(k + 1) + (k + 1)(k + 2).
  • 10. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c In view of (25), this simplifies to: [1 · 2 + 2 · 3 + 3 · 4 + · · · + k(k + 1)] + (k + 1)(k + 2) = k(k + 1)(k + 2) 3 + (k + 1)(k + 2) = k(k + 1)(k + 2) + 3(k + 1)(k + 2) 3 = (k + 1)(k + 2)(k + 3) 3 . Thus the left-hand side of (26) is equal to the right-hand side of (26). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 14. 1(2−1 ) + 2(2−2 ) + 3(2−3 ) + · · · + n(2−n ) = 2 − (n + 2)2−n Proof: For n = 1, the statement reduces to 1(2−1 ) = 2 − 3 · 2−1 . This is equiva- lent to 1 2 = 2 − 3 2 and is obviously true. Assuming the statement is true for n = k: 1(2−1 ) + 2(2−2 ) + 3(2−3 ) + · · · + k(2−k ) = 2 − (k + 2)2−k , (27) we will prove that the statement must be true for n = k + 1: 1(2−1 )+2(2−2 )+3(2−3 )+· · ·+(k +1)[2−(k+1) ] = 2−(k +3)2−(k+1) . (28) The left-hand side of (28) can be written as 1(2−1 ) + 2(2−2 ) + 3(2−3 ) + · · · + k(2−k ) + (k + 1)[2−(k+1) ]. In view of (27), this simplifies to: 1(2−1 ) + 2(2−2 ) + 3(2−3 ) + · · · + k(2−k ) + (k + 1)[2−(k+1) ] = 2 − (k + 2)2−k + (k + 1)[2−(k+1) ] = 2 − 2(k + 2)[2−(k+1) ] + (k + 1)[2−(k+1) ] = 2 − [2(k + 2) − (k + 1)][2−(k+1) ] = 2 − (k + 3)2−(k+1) . Thus the left-hand side of (28) is equal to the right-hand side of (28). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 15. 1(1!) + 2(2!) + 3(3!) + · · · + n(n!) = (n + 1)! − 1 Proof: For n = 1, the statement reduces to 1(1!) = 2! − 1 and is obviously true.
  • 11. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c Assuming the statement is true for n = k: 1(1!) + 2(2!) + 3(3!) + · · · + k(k!) = (k + 1)! − 1 , (29) we will prove that the statement must be true for n = k + 1: 1(1!) + 2(2!) + 3(3!) + · · · + (k + 1)[(k + 1)!] = (k + 2)! − 1 . (30) The left-hand side of (30) can be written as 1(1!) + 2(2!) + 3(3!) + · · · + k(k!) + (k + 1)[(k + 1)!]. In view of (29), this simplifies to: [1(1!) + 2(2!) + 3(3!) + · · · + k(k!)] + (k + 1)[(k + 1)!] = (k + 1)! − 1 + (k + 1)[(k + 1)!] = [1 + (k + 1)][(k + 1)!] − 1 = (k + 2)[(k + 1)!] − 1 = (k + 2)! − 1. Thus the left-hand side of (30) is equal to the right-hand side of (30). This proves the inductive step. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 16. Find and verify a formula for the sum 1 1 · 2 + 1 2 · 3 + 1 3 · 4 + · · · + 1 n(n + 1) , n ≥ 1 . Solution: We can evaluate the sum for the first few values of n: n = 1 : 1 1 · 2 = 1 2 n = 2 : 1 1 · 2 + 1 2 · 3 = 2 3 n = 3 : 1 1 · 2 + 1 2 · 3 + 1 3 · 4 = 3 4 n = 4 : 1 1 · 2 + 1 2 · 3 + 1 3 · 4 + 1 4 · 5 = 4 5 n = 5 : 1 1 · 2 + 1 2 · 3 + 1 3 · 4 + 1 4 · 5 + 1 5 · 6 = 5 6 The pattern seems to suggest the following formula: 1 1 · 2 + 1 2 · 3 + 1 3 · 4 + · · · + 1 n(n + 1) = n n + 1 (31) We have verified that the formula is valid for n = 1, 2, 3, 4, 5. Now we will use mathematical induction to prove that the formula (31) is valid
  • 12. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c for every positive integer n. Since the case n = 1 has been verified, we will proceed with the inductive step. Assuming the formula (31) is valid for n = k: 1 1 · 2 + 1 2 · 3 + 1 3 · 4 + · · · + 1 k(k + 1) = k k + 1 , (32) we will prove that (31) must be true for n = k + 1: 1 1 · 2 + 1 2 · 3 + 1 3 · 4 + · · · + 1 (k + 1)(k + 2) = k + 1 k + 2 . (33) The left-hand side of (33) can be written as 1 1 · 2 + 1 2 · 3 + 1 3 · 4 + · · · + 1 k(k + 1) + 1 (k + 1)(k + 2) . In view of (32), this simplifies to: 1 1 · 2 + 1 2 · 3 + 1 3 · 4 + · · · + 1 k(k + 1) + 1 (k + 1)(k + 2) = k k + 1 + 1 (k + 1)(k + 2) = k(k + 2) + 1 (k + 1)(k + 2) = k2 + 2k + 1 (k + 1)(k + 2) = (k + 1)2 (k + 1)(k + 2) = k + 1 k + 2 . Thus the left-hand side of (33) is equal to the right-hand side of (33). This proves the inductive step. Therefore, by the principle of mathematical induction, the formula (31) is valid for every positive integer n. 17. Find and verify a formula for the sum 1 + 3 + 5 + · · · + (2n − 1) of the first n odd integers. Solution: We can evaluate the sum for the first few values of n: n = 1 : 1 = 1 n = 2 : 1 + 3 = 4 n = 3 : 1 + 3 + 5 = 9 n = 4 : 1 + 3 + 5 + 7 = 16 n = 5 : 1 + 3 + 5 + 7 + 9 = 25
  • 13. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c The pattern seems to suggest the following formula: 1 + 3 + 5 + · · · + (2n − 1) = n2 . (34) We have verified that the formula is valid for n = 1, 2, 3, 4, 5. Now we will use mathematical induction to prove that the formula (34) is valid for every positive integer n. Since the case n = 1 has been verified, we will proceed with the inductive step. Assuming the formula (34) is valid for n = k: 1 + 3 + 5 + · · · + (2k − 1) = k2 , (35) we will prove that (34) must be true for n = k + 1: 1 + 3 + 5 + · · · + [2(k + 1) − 1] = (k + 1)2 . (36) The left-hand side of (36) can be written as 1 + 3 + 5 + · · · + (2k − 1) + [2(k + 1) − 1]. In view of (35), this simplifies to: [1 + 3 + 5 + · · · + (2k − 1)] + [2(k + 1) − 1] = k2 + [2(k + 1) − 1] = k2 + 2k + 1 = (k + 1)2 . Thus the left-hand side of (36) is equal to the right-hand side of (36). This proves the inductive step. Therefore, by the principle of mathematical induction, the formula (31) is valid for every positive integer n. 18. Prove that 7 divides 8n − 1 for n ≥ 1. Proof: For n = 1, the statement claims that 7 divides 8 − 1. This is obviously true. Assuming the statement is true for n = k, i.e., 8k − 1 is divisible by 7 , (37) we will prove that the statement must be true for n = k + 1: 8k+1 − 1 is divisible by 7. (38) In order to make use of the inductive hypothesis (37), we can transform
  • 14. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c the expression 8k+1 − 1 as follows: 8k+1 − 1 = 8 · 8k − 1 = 8(8k − 1) + 7. The last expression must be divisible by 7 since, by the inductive hy- pothesis, 8k − 1 is divisible by 7, and obviously, 7 is divisible by 7. Thus (38) holds and the inductive step is proved. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 19. Prove that 15 divides 42n − 1 for n ≥ 1. Proof: For n = 1, the statement claims that 15 divides 42 − 1. This is obviously true. Assuming the statement is true for n = k, i.e., 42k − 1 is divisible by 15 , (39) we will prove that the statement must be true for n = k + 1: 42(k+1) − 1 is divisible by 15. (40) In order to make use of the inductive hypothesis (39), we can transform the expression 42(k+1) − 1 as follows: 42(k+1) − 1 = 42k+2 − 1 = 42 · 42k − 1 = 16(42k − 1) + 15. The last expression must be divisible by 15 since, by the inductive hypoth- esis, 42k − 1 is divisible by 15, and obviously, 15 is divisible by 15. Thus (40) holds and the inductive step is proved. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 20. Prove that 4 divides 3(72n − 1) for n ≥ 1. Proof: For n = 1, the statement claims that 4 divides 3(72 − 1) = 144. This is obviously true. Assuming the statement is true for n = k, i.e., 3(72k − 1) is divisible by 4 , (41)
  • 15. Solutions to Exercises on Mathematical Induction Math 1210, Instructor: M. Despi´c we will prove that the statement must be true for n = k + 1: 3 72(k+1) − 1 is divisible by 4. (42) In order to make use of the inductive hypothesis (41), we can transform the expression 3 72(k+1) − 1 as follows: 3 72(k+1) − 1 = 3 72k+2 − 1 = 3 72 · 72k − 1 = 3 49(72k − 1) + 48 = 147(72k − 1) + 144. The last expression must be divisible by 4 since, by the inductive hypoth- esis, 42k − 1 is divisible by 4, and obviously, 144 is divisible by 4. Thus (42) holds and the inductive step is proved. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n. 21. Prove that 5 divides 42n − 1 for n ≥ 1. Proof: For n = 1, the statement claims that 5 divides 42 − 1 = 15. This is obviously true. Assuming the statement is true for n = k, i.e., 42k − 1 is divisible by 5 , (43) we will prove that the statement must be true for n = k + 1: 42(k+1) − 1 is divisible by 5. (44) In order to make use of the inductive hypothesis (43), we can transform the expression 42(k+1) − 1 as follows: 42(k+1) − 1 = 42k+2 − 1 = 42 · 42k − 1 = 16(42k − 1) + 15. The last expression must be divisible by 5 since, by the inductive hypoth- esis, 42k − 1 is divisible by 5, and obviously, 15 is divisible by 5. Thus (44) holds and the inductive step is proved. Therefore, by the principle of mathematical induction, the given statement is true for every positive integer n.