P1: 1/1 P2: 1/2 QC: 1/1 T1: 2

CH01-7T Rosen-2311T MHIA017-Rosen-v5.cls May 13, 2011 15:27

Choice: Even & odd 1

Assignment Topic: Sequences, Summation, Proof, and Mathematical Induction

1. Use a direct proof to show that the sum of two odd integers 18. Find the first five terms of the sequence defined by each
is even. of these recurrence relations and initial conditions.
2. Use a direct proof to show that the sum of two even inte- a) an = 6an−1 , a0 = 2
gers is even. b) an = an2−1 , a1 = 2
3. Show that the square of an even number is an even number c) an = an−1 + 3an−2 , a0 = 1, a1 = 2
using a direct proof. d) an = nan−1 + n2 an−2 , a0 = 1, a1 = 1
e) an = an−1 + an−3 , a0 = 1, a1 = 2, a2 = 0
4. Use a direct proof to show that the product of two odd
numbers is odd. 19. Find the first six terms of the sequence defined by each
of these recurrence relations and initial conditions.
5. Prove that if n is a perfect square, then n + 2 is not a
a) an = −2an−1 , a0 = −1
perfect square.
b) an = an−1 − an−2 , a0 = 2, a1 = −1
6. Use a direct proof to show that the product of two rational c) an = 3an2−1 , a0 = 1
numbers is rational. d) an = nan−1 + an2−2 , a0 = −1, a1 = 0
7. Prove that if x is rational and x  = 0, then 1/x is rational. e) an = an−1 − an−2 + an−3 , a0 = 1, a1 = 1, a2 = 2
8. Use a proof by contraposition to show that if x + y ≥ 2, 20. Let an = 2n + 5 · 3n for n = 0, 1, 2, . . . .
where x and y are real numbers, then x ≥ 1 or y ≥ 1. a) Find a0 , a1 , a2 , a3 , and a4 .
9. Show that if n is an integer and n3 + 5 is odd, then n is b) Show that a2 = 5a1 − 6a0 , a3 = 5a2 − 6a1 , and
even using a4 = 5a3 − 6a2 .
a) a proof by contraposition. c) Show that an = 5an−1 − 6an−2 for all integers n with
n ≥ 2.
b) a proof by contradiction.
21. Show that the sequence {an } is a solution of the recurrence
10. Prove that if n is an integer and 3n + 2 is even, then n is relation an = −3an−1 + 4an−2 if
even using a) an = 0. b) an = 1.
a) a proof by contraposition. c) an = (−4)n . d) an = 2(−4)n + 3.
b) a proof by contradiction.
11. Prove that if n is a positive integer, then n is even if and 22. Is the sequence {an } a solution of the recurrence relation
only if 7n + 4 is even. an = 8an−1 − 16an−2 if
a) an = 0? b) an = 1?
12. Prove that if n is a positive integer, then n is odd if and
c) an = 2n ? d) an = 4n ?
only if 5n + 6 is odd.
e) an = n4n ? f ) an = 2 · 4n + 3n4n ?
13. Prove that m2 = n2 if and only if m = n or m = −n. g) an = (−4) ?n h) an = n2 4n ?

14. Find these terms of the sequence {an }, where an = 23. Find the solution to each of these recurrence relations with
2 · (−3)n + 5n . the given initial conditions. Use an iterative approach.
a) a0 b) a1 c) a4 d) a5 a) an = −an−1 , a0 = 5
15. What is the term a8 of the sequence {an } if an equals b) an = an−1 + 3, a0 = 1
a) 2n−1 ? b) 7? c) an = an−1 − n, a0 = 4
c) 1 + (−1)n ? d) −(−2)n ? d) an = 2an−1 − 3, a0 = −1
16. What are the terms a0 , a1 , a2 , and a3 of the sequence {an }, e) an = (n + 1)an−1 , a0 = 2
where an equals f ) an = 2nan−1 , a0 = 3
g) an = −an−1 + n − 1, a0 = 7
a) 2n + 1? b) (n + 1)n+1 ?
24. Find the solution to each of these recurrence relations and
17. What are the terms a0 , a1 , a2 , and a3 of the sequence {an }, initial conditions. Use an iterative approach.
where an equals
a) an = 3an−1 , a0 = 2
a) (−2)n ? b) 3?
n b) an = an−1 + 2, a0 = 3
c) 7 + 4 ? d) 2n + (−2)n ? c) an = an−1 + n, a0 = 1
d) an = an−1 + 2n + 3, a0 = 4
e) an = 2an−1 − 1, a0 = 1
f) an = 3an−1 + 1, a0 = 1
g) an = nan−1 , a0 = 5
h) an = 2nan−1 , a0 = 1
P1: 1
CH02-7T Rosen-2311T MHIA017-Rosen-v5.cls May 13, 2011 10:24

25. What are the values of these sums? 32. Let P (n) be the statement that 13 + 23 + · · · + n3 =
5 
4 (n(n + 1)/2)2 for the positive integer n.
a) (k + 1) b) (−2)j
k=1 j =0 a) What is the statement P (1)?
10 8
b) Show that P (1) is true, completing the basis step of
c) 3 d) (2j +1 − 2j )
i =1 j =0 the proof.
c) What is the inductive hypothesis?
26. What are the values of these sums, where S = {1, 3, 5, 7}?
  2 d) What do you need to prove in the inductive step?
a) j b) j
j ∈S j ∈S e) Complete the inductive step, identifying where you
 
c) (1/j ) d) 1 use the inductive hypothesis.
j ∈S j ∈S
27. What is the value of each of these sums of terms of a f ) Explain why these steps show that this formula is true
geometric progression? whenever n is a positive integer.
8 8 33. Prove that 12 + 32 + 52 + · · · + (2n + 1)2 = (n + 1)
a) 3 · 2j b) 2j (2n + 1)(2n + 3)/3 whenever n is a nonnegative integer.
j =0 j =1
34. Prove that 1 · 1! + 2 · 2! + · · · + n · n! = (n + 1)! − 1

8 
8
c) (−3)j d) 2 · (−3)j whenever n is a positive integer.
j =2 j =0
28. Find the value of each of these sums. 35. Prove that 3 + 3 · 5 + 3 · 52 + · · · + 3 · 5n =3(5n+1 − 1)/4
8 8 whenever n is a nonnegative integer.
a) (1 + (−1)j ) b) (3j − 2j )
j =0 j =0 36. Prove that 2 − 2 · 7 + 2 · 72 − · · · + 2(−7)n = (1 −

8 
8 (−7)n+1 )/4 whenever n is a nonnegative integer.
c) (2 · 3j + 3 · 2j ) d) (2j +1 − 2j )
j =0 j =0
37. Prove that 12 − 22 + 32 − · · · + (−1)n−1 n2 = (−1)n−1
29. Compute each of these double sums.
n(n + 1)/2 whenever n is a positive integer.

2  3 2  3 n k
a) (i + j ) b) (2i + 3j ) 38. Prove that for every positive integer n, k = 1 k2 =
i =1 j =1 i =0 j =0 (n − 1)2n+1 + 2.

3 
2 
2 
3
39. Prove that for every positive integer n,
c) i d) ij
i =1 j =0 i =0 j =1 1 · 2 + 2 · 3 + · · · + n(n + 1) = n(n + 1)(n + 2)/3.
30. Compute each of these double sums.

3  2 3  2 40. Prove that for every positive integer n,
a) (i − j ) b) (3i + 2j )
i =1 j =1 i =0 j =0 1 · 2 · 3 + 2 · 3 · 4 + · · · + n(n + 1)(n + 2)

3 
2 
2 
3 = n(n + 1)(n + 2)(n + 3)/4.
c) j d) i2j 3
i =1 j =0 i =0 j =0 n
41. Prove that j = 1 j 4 = n(n + 1)(2n + 1)(3n2 + 3n −1)/30
Use mathematical induction in questions 31–41 to prove whenever n is a positive integer.
sum-mation formulae. Be sure to identify where you use
the in-ductive hypothesis. Use mathematical induction to prove the inequalities in
31. Let P (n) be the statement that questions 42–45.
12 + 22 + · · · + n2 =
n(n + 1)(2n + 1)/6 for the positive integer n. 42. Let P (n) be the statement that n! < nn , where n is an
integer greater than 1.
a) What is the statement P (1)?
a) What is the statement P (2)?
b) Show that P (1) is true, completing the basis step of b) Show that P (2) is true, completing the basis step of
the proof. the proof.
c) What is the inductive hypothesis?
c) What is the inductive hypothesis?
d) What do you need to prove in the inductive step?
d) What do you need to prove in the inductive step? e) Complete the inductive step.
f ) Explain why these steps show that this inequality is
e) Complete the inductive step, identifying where you true whenever n is an integer greater than 1.
use the inductive hypothesis.
f ) Explain why these steps show that this formula is true
whenever n is a positive integer.
P1: 1
CH05-7R Rosen-2311T MHIA017-Rosen-v5.cls May 13, 2011 10:25

43. Let P (n) be the statement that 51. Determine whether each of these proposed definitions is
1 1 1 1 a valid recursive definition of a function f from the set
1 + + + ··· + 2 < 2 − , of nonnegative integers to the set of integers. If f is well
4 9 n n
defined, find a formula for f (n) when n is a nonnegative
where n is an integer greater than 1. integer and prove that your formula is valid.
a) What is the statement P (2)? a) f (0) = 1, f (n) = −f (n − 1) for n ≥ 1
b) Show that P (2) is true, completing the basis step of
b) f (0) = 1, f (1) = 0, f (2) = 2, f (n) = 2f (n − 3)
the proof.
for n ≥ 3
c) What is the inductive hypothesis? c) f (0) = 0, f (1) = 1, f (n) = 2f (n + 1) for n ≥ 2
d) What do you need to prove in the inductive step?
d) f (0) = 0, f (1) = 1, f (n) = 2f (n − 1) for n ≥ 1
e) Complete the inductive step.
f ) Explain why these steps show that this inequality is e) f (0) = 2, f (n) = f (n − 1) if n is odd and n ≥ 1 and
true whenever n is an integer greater than 1. f (n) = 2f (n − 2) if n ≥ 2
44. Prove that 3n < n! if n is an integer greater than 6.
In following questions 52–53 fn is the nth Fibonacci number.
45. Prove that 2n > n2 if n is an integer greater than 4.
52. Prove that f 12 + f 22 + · · · + f n2 = fn fn+1 when n is a
46. Find f (1), f (2), f (3), and f (4) if f (n) is defined recur- positive integer.
sively by f (0) = 1 and for n = 0, 1, 2, . . . 53. Prove that f1 + f3 + · · · + f2n−1 = f2n when n is a pos-
a) f (n + 1) = f (n) + 2. itive integer.
b) f (n + 1) = 3f (n). 54. Let S be the subset of the set of ordered pairs of integers
c) f (n + 1) = 2f (n) . defined recursively by
d) f (n + 1) = f (n)2 + f (n) + 1.
Basis step: (0, 0) ∈ S.
47. Find f (1), f (2), f (3), f (4), and f (5) if f (n) is defined
recursively by f (0) = 3 and for n = 0, 1, 2, . . . Recursive step: If (a, b) ∈ S, then (a + 2, b + 3) ∈ S
a) f (n + 1) = −2f (n). and (a + 3, b + 2) ∈ S.
b) f (n + 1) = 3f (n) + 7. a) List the elements of S produced by the first five ap-
c) f (n + 1) = f (n)2 − 2f (n) − 2. plications of the recursive definition.
d) f (n + 1) = 3f (n)/3 . b) Use strong induction on the number of applications
48. Find f (2), f (3), f (4), and f (5) if f is defined recur- of the recursive step of the definition to show that
sively by f (0) = −1, f (1) = 2, and for n = 1, 2, . . . 5 | a + b when (a, b) ∈ S.
a) f (n + 1) = f (n) + 3f (n − 1). c) Use structural induction to show that 5 | a + b when
b) f (n + 1) = f (n)2 f (n − 1). (a, b) ∈ S.
c) f (n + 1) = 3f (n)2 − 4f (n − 1)2 . 55. Let S be the subset of the set of ordered pairs of integers
d) f (n + 1) = f (n − 1)/f (n). defined recursively by
49. Find f (2), f (3), f (4), and f (5) if f is defined recur- Basis step: (0, 0) ∈ S.
sively by f (0) = f (1) = 1 and for n = 1, 2, . . .
Recursive step: If (a, b) ∈ S, then (a, b + 1) ∈ S,
a) f (n + 1) = f (n) − f (n − 1). (a + 1, b + 1) ∈ S, and (a + 2, b + 1) ∈ S.
b) f (n + 1) = f (n)f (n − 1).
a) List the elements of S produced by the first four ap-
c) f (n + 1) = f (n)2 + f (n − 1)3 .
plications of the recursive definition.
d) f (n + 1) = f (n)/f (n − 1).
b) Use strong induction on the number of applications of
50. Determine whether each of these proposed definitions is the recursive step of the definition to show that a ≤ 2b
a valid recursive definition of a function f from the set whenever (a, b) ∈ S.
of nonnegative integers to the set of integers. If f is well c) Use structural induction to show that a ≤ 2b when-
defined, find a formula for f (n) when n is a nonnegative ever (a, b) ∈ S.
integer and prove that your formula is valid.
a) f (0) = 0, f (n) = 2f (n − 2) for n ≥ 1
b) f (0) = 1, f (n) = f (n − 1) − 1 for n ≥ 1
c) f (0) = 2, f (1) = 3, f (n) = f (n − 1) − 1 for
n ≥ 2
d) f (0) = 1, f (1) = 2, f (n) = 2f (n − 2) for n ≥ 2
e) f (0) = 1, f (n) = 3f (n − 1) if n is odd and n ≥ 1

and f (n) = 9f (n − 2) if n is even and n ≥ 2