1. The variable n represents a positive integer. Use mathematical induction to prove each 1. The variable n represents a positive integer. Use mathematical induction to prove each
statement. statement.
n
n(3n + 1) (l) 2 n + 3 n < 4 n ∀n ≥ 2 . n
n(3n + 1) (l) 2 n + 3 n < 4 n ∀n ≥ 2 .
(a) ∑ (3r − 1) = (a) ∑ (3r − 1) =
r =1 2 (m) 2n + 1 < 2 n ∀n ≥ 3 . r =1 2 (m) 2n + 1 < 2 n ∀n ≥ 3 .
(b) 1 + 3 + 5 + L + (2n − 1) = n 2
(n) (1 + a) n ≥ 1 + na where a > −1 & a ∈ R/ . (b) 1 + 3 + 5 + L + (2n − 1) = n 2
(n) (1 + a) n ≥ 1 + na where a > −1 & a ∈ R/ .
n(n + 1)(n + 2) n
n(n + 1)(n + 2) n
(c) 2 + 6 + 12 + L + n(n + 1) = (o) L ∑ (6r − 5) = n(3n − 2) (c) 2 + 6 + 12 + L + n(n + 1) = (o) L ∑ (6r − 5) = n(3n − 2)
3 r =1 3 r =1
1 1 1 1 n 1 1 1 1 n
= (5 − 1) (p) ∑ 5 r −1 = 14 (5 n − 1)
n n
(d) + + + L + = (p) ∑ 5 r −1 1 n (d) + + + L + =
2 6 12 n(n + 1) n + 1 r =1
4 2 6 12 n(n + 1) n + 1 r =1
1 n 1 n
(e) 1 + 8 + 125 + L + n 3 = n 2 (n + 1) 2
4 (q) ∑ r = n(n + 1)(2n + 1)
2 1
6
(e) 1 + 8 + 125 + L + n 3 = n 2 (n + 1) 2
4 (q) ∑ r 2 = 16 n(n + 1)(2n + 1)
r =1 r =1
(f) 7 n − 1 is divisible by 6. (f) 7 n − 1 is divisible by 6.
n
n2 n
n2
(g) 2 2 n − 1 is divisible by 3 (r) ∑ r = (n + 1)
3 2
(g) 2 2 n − 1 is divisible by 3 (r) ∑r 3
= (n + 1)2
r =1 4 r =1 4
(h) ( x − y ) is a factor of x n − y n . (h) ( x − y ) is a factor of x n − y n .
(i) ( x + y ) is a factor of x − y .
2n 2n
(i) ( x + y ) is a factor of x − y .
2n 2n