Scribd
Upload
10 views

Discussion Problems and Solutions 6: 1 Section 3.2

This document contains solutions to 3 exercises involving proofs of mathematical identities using induction. The first exercise proves relationships between pairs of functions by taking limits. The second exercise proves the identity relating the sum of squares of consecutive odd integers to a factored expression involving n. The third exercise proves the identity relating the sum of consecutive integer multiples to a factored expression involving n. Both the second and third exercises are proved using mathematical induction.

Uploaded by

Myd Faim
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

Discussion Problems and Solutions 6: 1 Section 3.2

This document contains solutions to 3 exercises involving proofs of mathematical identities using induction. The first exercise proves relationships between pairs of functions by taking limits. The second exercise proves the identity relating the sum of squares of consecutive odd integers to a factored expression involving n. The third exercise proves the identity relating the sum of consecutive integer multiples to a factored expression involving n. Both the second and third exercises are proved using mathematical induction.

Uploaded by

Myd Faim
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Discussion Problems and Solutions 6

Section 3.2

Exercise 1: Find the relationship between the following pair of functions.


(a) f (x) = x log x, g(x) = x2
(b) f (x) = (ln x)3 , g(x) = x
(c) f (x) = x2 , g(x) = 2x
x
2
(d)f (x) = 22 , g(x) = 2x
Solution:
(a)
x log x
log x
1
lim
= lim
= lim
=0
2
x
x x
x x ln 2
x
(b)
(ln x)3
3(ln x)2
6 ln x
6
lim
= lim
= lim
= lim = 0
x
x
x
x x
x
x
x
(c)
2x
2
x2
= lim x
=0
lim x = lim x
x 2 ln 2
x 2 (ln 2)2
x 2
(d)

22
x
2
lim x2 = lim 22 x =
x 2
x

Section 4.1

Exercise 2: Prove that 12 + 32 + 52 + + (2n + 1)2 = (n + 1)(2n + 1)(2n + 3)/3


whenever n is a nonnegative integer.
1

Solution: We proceed by induction. The basis step, n = 0, is true, since 12 =


1 1 3/3. For the inductive step assume the inductive hypothesis that
12 + 32 + 52 + + (2k + 1)2 =

(k + 1)(2k + 1)(2k + 3)
3

We want to show that


(k + 2)(2k + 3)(2k + 5)
3
We need do a bit of algebraic manipulation to get this expression into the desired
form.
12 + 32 + 52 + + (2k + 1)2 + (2k + 3)2 =

12 + 32 + 52 + + (2k + 1)2 + (2k + 3)2


(k + 1)(2k + 1)(2k + 3)
=
+ (2k + 3)2
3
2k + 3
((k + 1)(2k + 1) + 3(2k + 3))
=
3
2k + 3
=
(2k 2 + 9k + 10)
3
(k + 2)(2k + 3)(2k + 5)
2k + 3
((k + 2)(2k + 5)) =
=
3
3
Exercise 3: Prove that for every positive integer n,
1 2 + 2 3 + + n(n + 1) = n(n + 1)(n + 2)/3
Solution: The base case of the statement P (n), when n = 1, is 1 2 = 1 2 3/3
which is certainly true. We assume the inductive hypothesis P (k), and try to
derive P (k + 1)
1 2 + 2 3 + + k(k + 1) + (k + 1)(k + 2) =

(k + 1)(k + 2)(k + 3)
3

Starting with the left-hand side of P (k + 1), we have


1 2 + 2 3 + + k(k + 1) + (k + 1)(k + 2)
k(k + 1)(k + 2)
=
+ (k + 1)(k + 2)
3


k
(k + 1)(k + 2)(k + 3)
=(k + 1)(k + 2)
+1 =
3
3

You might also like