Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

French-Azerbaijani University (UFAZ)

HOMEWORK 5 (Induction)

1) Use mathematical induction to prove that statement is true for all positive integers 7n ≥ 7n.
2) Prove that for any positive even integer number n , n(n + 2) is divisible by 8.
3) Prove that n(n2 + 5) is divisible by 6 for any positive integer n.
4) Use mathematical induction to prove that 6 is a factor of 4n + 2 for all positive integers n.
5) Use the Principle of Mathematical Induction to verify that, for any positive integer n,
(a) 6n − 1 is divisible by 5.
(b) 5n + 2 × 11n is divisible by 3.
6) Show that, for any n ∈ N , 32n − 2n is a multiple of 7. In other words, prove (by induction principle)
that: ∃m ∈ N , 32n − 2n = 7m.
7) Prove using mathematical induction that for all natural n ≥ 1, 1 + 4 + 7 + ... + (3n − 2) = n(3n − 1)/2.
8) Show that, for any positive integer n, the sum fo the (n+1) rst consecutive odd natural cubes corresponds
to: n2 (2n2 − 1). In other words, prove (by induction principle) that:
13 + 33 + 53 + 73 + 93 + ... + (2n − 1)3 = n2 (2n2 − 1)
9) Show that, for any positive integers n, the sum of rst n consecutive even natural cubes corresponds to:
2n2 (n + 1)2 . In other words, prove (by induction principle) that:

23 + 43 + 63 + 83 + 103 + ... + (2n)3 = 2n2 (n + 1)2


10) Use mathematical induction to prove that the following statement is true for all positive integers n.
36 + 324 + 900 + ... + (12n − 6)2 = 12n(4n2 − 1)
11) Prove that for any integer n > 1 following inequality holds:
1 1 1 1
+ + ··· + >
n+1 n+2 2n 2
12) Prove that
1 × 2 + 2 × 5 + 3 × 8 + · · · + n × (3n − 1) = n2 (n + 1)

where n positive integer.


13) Show that, for any n ∈ N , the sum fo the (n + 1) rst odd natural integers corresponds to: (n + 1)2 . In
other words, prove (by induction principle) that: 1 + 3 + 5 + 7 + 9 + ... + (2n + 1) = (n + 1)2
14) Let x + x1 integer number. Prove that xn + x1n also integer for any positive integer n.
15) Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! − 1
for all positive integers n.
16) Let (vn )n be the sequence dened by, for any n ∈ N : v0 = 0 and vn = vn−1 + 2n. Show (by induction
principle) that, for any n ∈ N , vn = n(n + 1).
17) Let (un )n be the sequence dened by, for any n ∈ N : u0 = 1 and un = 2un−1 − 3. Show (by induction
principle) that, for any n ∈ N : un = 3 − 2n+1 .
18) Let (un )n be the sequence dened as follows. First term: u0 = −2, and the recursive relation:
un = 21 un−1 + 3 for any positive n ∈ N . Prove that un ≤ 6 for any n ∈ N .

19) Consider the sequence of real numbers dened by the relations x1 = 1 and xn = 1 + 2xn−1 for n ≥ 2.
Use the Principle of Mathematical Induction to show that xn < 3 for all n ≥ 1.

You might also like