1

Home Expert solutions Your library Create Upgrade: free 7-day trial Study sets, textboo...

Expert solutions Discrete Mathematics and Its Applications (7th Edition)

Exercise 19
Chapter 5, Section 5.1, Page 330

Discrete Mathematics and Its Applications

ISBN: 9780073383095

Table of contents

Solution Verified

Step 1 1 of 3

1 1 1 1
Let P (n) be 1 + + + ... + 2 < 2 − and n is an integer greater than 1.
4 9 n n
(a) Replace n by 2 in the given expression for P (n).

1 1
P (2) states 1 + 2 < 2 −
2 2

(b) Basis step

1 1 5 6 3 1
1+ 2 =1+ = < = =2−
2 4 4 4 2 2
We then note that P (2) is true.

(c) Induction hypothesis  Let P (k) be true.

1 1 1 1
1+ + + ... + 2 < 2 −
4 9 k k
(d) We need to prove that P (k + 1) is also true.
1 1 1 1 1
1+ + + ... + 2 + < 2 −
4 9 k (k + 1)2 k+1

(e) Induction step We need to prove that P (k + 1) is also true.

Step 2 2 of 3

1 1 1 1
1+ + + ... + 2 +
4 9 k (k + 1)2
1 1
<2− +
k (k + 1)2
−(k + 1)2 k
=2+ +
k(k + 1)2 k(k + 1)2
−(k + 1)2 + k
=2+
k(k + 1)2
−(k 2 + 2k + 1) + k
=2+
k(k + 1)2
−k 2 − k − 1
=2+
k(k + 1)2
k2 + k + 1
=2−
k(k + 1)2
k2 + k 1
=2− −
k(k + 1)2 k(k + 1)2
k(k + 1) 1
=2− −
k(k + 1)2 k(k + 1)2
1 1
=2− −
k + 1 k(k + 1)2
1 1
<2− Since  2
 is positive
k+1 k(k + 1)

We then note that P (k + 1) is also true.

(f) Conclusion By the principle of mathematical induction, P (n) is true for all positive integers n greater than 1.

Result 3 of 3

1 1
(a) 1 + < 2 −
22 2
(b) Verified

1 1 1 1
+ + ... + 2 < 2 −
(c) P (k), which is equivalent with 1 +
4 9 k k
1 1 1 1 1
(d) P (k + 1), which is equivalent with 1 + + + ... + 2 + <2−
4 9 k (k + 1)2 k+1

(e) Verified

(f) By the principle of mathematical induction, P (n) is true for all positive integers n greater than 1.

Exercise 18 Exercise 20

Privacy Terms