Chapter 31: Solutions to Solved Problems

31.1 Problem : Prove by mathematical induction that, for all positive integers n ,
n (n + 1)
1+2+3+...+n =
2

Solution :

Step 1 : Base Case (Let n = 1)

1(1 + 1) (1 is the left side of the equation because only the 1st term is needed since n = 1. If n = 2, then the left side of the equation
1 =
2 becomes 1 + 2 since there are now two terms to be considered. Likewise if n = 3, n = 4, … etc.)
1(2)
=
2

1 = 1 (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

k(k + 1)
1+2+3...+k =
2
 Chapter 31: Solutions to Solved Problems
31.1 Problem : Prove by mathematical induction that, for all positive integers n ,
n (n + 1)
1+2+3+...+n =
2

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

(k + 1)[(k + 1) + 1]
1 + 2 + 3 . . . + k + (k + 1) =
2

By recalling Step 2:

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

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

k(k + 1) (k + 1)[(k + 1) + 1]
+ (k + 1) =
2 2

By performing algebraic manipulations…:

k(k + 1) + 2(k + 1) (k + 1)[(k + 1) + 1]

=
2 2
k(k + 1) + 2k + 2 (k + 1)[(k + 1) + 1]
=
2 2
k(k + 1) + 2(k + 1) (k + 1)[(k + 1) + 1]
=
2 2
(k + 1)(k + 2) (k + 1)[(k + 1) + 1]
=
2 2
(k + 1)[(k + 1) + 1] (k + 1)[(k + 1) + 1]
Answer : = (True)
2 2
 Chapter 31: Solutions to Solved Problems
31.2 Problem : Prove by mathematical induction that the sum of n terms of an arithmetic sequence a , a + d , a + 2d , . . . is
n
( )[
2
2a + (n - 1)d ]
Solution :

Step 1 : Base Case (Let n = 1)

a = ( 12 ) [ 2a + (1 - 1)d ] (Identical approach to 31.1 Step 1.)

= ( 12 ) [ 2a + (0)d ]
= ( 12 ) [ 2a ]
a = a (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

a + a + d + a + 2d + . . . + a + (k - 1)d = ( 2k ) [ 2a + (k - 1)d ]
 Chapter 31: Solutions to Solved Problems
31.2 Problem : Prove by mathematical induction that the sum of n terms of an arithmetic sequence a , a + d , a + 2d , . . . is
n
( )[
2
2a + (n - 1)d ]
Solution :

Step 3 : Prove by Induction (Let n = k + 1)

k+1
a + a + d + a + 2d + . . . + a + (k - 1)d + a + k = ( 2 )[ 2a + [(k + 1) - 1]d ]
By recalling Step 2:

a + a + d + a + 2d + . . . + a + (k - 1)d = ( 2k ) [ 2a + (k - 1)d ]
Substitute the equation of Step 2 to the equation of Step 3 that yields to:

k+1
( 2k ) [ 2a + (k - 1)d ] + a + kd = ( 2 )[ 2a + [(k + 1) - 1]d ]
By performing algebraic manipulations…:

k[2a + (k - 1)d ] + 2(a + kd ) k+1

2
=( 2 )[ 2a + [(k + 1) - 1]d ]
k[2a + kd - d ] + 2(a + kd ) k+1
= (
2 ) [ ]
2a + kd
2
2ka + k2d - kd + 2a + 2kd k+1
= (
2 ) [ ]
2a + kd
2
2
2ka + k d + kd + 2a k+1
= (
2 ) [ ]
2a + kd
2
2a (k + 1) + kd (k + 1) k+1
= (
2 ) [ ]
2a + kd
2
k+1 k+1
Answer : ( 2 )[ 2a + kd ]=( 2 )[ 2a + kd ] (True)
 Chapter 31: Solutions to Solved Problems
31.3 Problem : Prove by mathematical induction that, for all positive integers n ,
n (n + 1)(2n + 1)
12 + 22 + 32 + . . . + n 2 =
6

Solution :

Step 1 : Base Case (Let n = 1)

1(1 + 1)[2(1) + 1]
12 = (Identical approach to 31.2 Step 1.)
6
1(2)(3)
=
6
6
=
6

1 = 1 (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

k(k + 1)(2k + 1)
12 + 22 + 32 + . . . + k2 =
6
 Chapter 31: Solutions to Solved Problems
31.3 Problem : Prove by mathematical induction that, for all positive integers n ,
n (n + 1)(2n + 1)
12 + 22 + 32 + . . . + n 2 =
6

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

(k + 1)[(k + 1) + 1][2(k + 1) + 1]
12 + 22 + 32 + . . . + k2 + (k + 1)2 =
6

By recalling Step 2:

k(k + 1)(2k + 1)
12 + 22 + 32 + . . . + k2 =
6

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

k(k + 1)(2k + 1) (k + 1)[(k + 1) + 1][2(k + 1) + 1]

+ (k + 1)2 =
6 6

By performing algebraic manipulations…:

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

=
6 6
(k + 1)[(k(2k + 1) + 6(k + 1)] (k + 1)(k + 2)(2k + 3)
=
6 6
(k + 1)(2k2 + k + 6k + 6) (k + 1)(k + 2)(2k + 3)
=
6 6
(k + 1)(2k2 + 7k + 6) (k + 1)(k + 2)(2k + 3)
=
6 6
(k + 1)(k + 2)(2k + 3) (k + 1)(k + 2)(2k + 3)
Answer : = (True)
6 6
 Chapter 31: Solutions to Solved Problems
31.4 Problem : Prove by mathematical induction that, for all positive integers n ,
1 1 1 1 n
+ + + ... + =
1·3 3·5 5·7 (2n - 1)(2n + 1) 2n + 1

Solution :

Step 1 : Base Case (Let n = 1)

1 1
= (Identical approach to 31.3 Step 1.)
1·3 2(1) + 1
1 1
=
1·3 2+1
1 1
= (True)
3 3

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

1 1 1 1 k
+ + + ... + =
1·3 3·5 5·7 (2k - 1)(2k + 1) 2k + 1
 Chapter 31: Solutions to Solved Problems
31.4 Problem : Prove by mathematical induction that, for all positive integers n ,
1 1 1 1 n
+ + + ... + =
1·3 3·5 5·7 (2n - 1)(2n + 1) 2n + 1

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

1 1 1 1 1 (k + 1)
+ + + ... + + =
1·3 3·5 5·7 (2k - 1)(2k + 1) [2(k + 1) - 1][(2(k + 1) + 1] 2(k + 1) + 1

By recalling Step 2:

1 1 1 1 k
+ + + ... + =
1·3 3·5 5·7 (2k - 1)(2k + 1) 2k + 1

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

k 1 k+1
+ =
2k + 1 [2(k + 1) - 1][(2(k + 1) + 1] 2(k + 1) + 1

By performing algebraic manipulations…:

k 1 k+1
+ =
2k + 1 (2k + 2 - 1)(2k + 2 + 1) 2(k + 1) + 1
k 1 k+1
+ =
2k + 1 (2k + 1)(2k + 3) 2(k + 1) + 1
k(2k + 3) + 1 k+1
=
(2k + 1)(2k + 3) 2(k + 1) + 1
2k2 + 3k + 1 k+1
=
(2k + 1)(2k + 3) 2(k + 1) + 1
(2k + 1)(k + 1) k+1
= (2k + 3 is also equal to 2(k + 1) + 1 )
(2k + 1)(2k + 3) 2(k + 1) + 1
(k + 1) k+1
Answer : = (True)
2(k + 1) + 1 2(k + 1) + 1
 Chapter 31: Solutions to Solved Problems
31.5 Problem : Prove by mathematical induction that a2n - b2n is divisible by a + b when n is any positive integer.

Solution :

Step 1 : Base Case (Let n = 1)

a2(1) - b2(1)
= N (Let N be the quotient )
a+b
a2 - b2
= N
a+b
(a + b)(a - b)
= N
a+b
(a - b) = N (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

a2k - b2k
= M (Let M be the quotient )
a+b
a2k - b2k = M(a + b)
a2k = M(a + b) + b2k
 Chapter 31: Solutions to Solved Problems
31.5 Problem : Prove by mathematical induction that a2n - b2n is divisible by a + b when n is any positive integer.

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

a2(k + 1) - b2(k+ 1)
= L (Let L be the quotient )
a+b

By recalling Step 2:

a2k = M(a + b) + b2k

a2k·a2 - b2k·b2 = L(a + b)

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

a2·[M(a + b) + b2k] - b2k·b2 = L(a + b)

By performing algebraic manipulations…:

a2M(a + b) + a2b2k - b2k·b2 = L(a + b)

a2M(a + b) + b2k(a2 - b2) = L(a + b)
a2M(a + b) + b2k(a + b)(a - b) = L(a + b)

Dividing both sides of the equation by (a + b) yields to:

Answer : a2M + b2k(a - b) = L (True)

 Chapter 31: Solutions to Solved Problems
31.5 Problem : Prove by mathematical induction that a2n - b2n is divisible by a + b when n is any positive integer.

Addendum : Let's prove the identity: a2k + 2 - b2k + 2 = a2(a2k - b2k) + b2k(a2 - b2) based from Schaum's Outline College Algebra Chapter 31,31.5, Page 368

By using the Step 2 equation from the previous page and also the Answer above…:

a2M + b2k(a - b) = L
a2(k + 1) - b2(k+ 1)
a2 + b2k(a - b) = L
a+b
a2(a2k - b2k) + b2k(a - b) = L(a + b)

Remember that L(a+ b) is the modified equation of Step 3

a2(k + 1) - b2(k+ 1)
= L
a+b
a2(k + 1) - b2(k+ 1) = L(a + b)

Equating both equations above…:

a2(k + 1) - b2(k+ 1) = a2(a2k - b2k) + b2k(a - b) (Proved)

 Chapter 31: Solutions to Solved Problems
31.6 Problem : Prove the binomial formula
n (n - 1) n n (n - 1). . .(n - r + 2) n
(a + x)n = an + n an -1
+ a -2 2
x + ... + a -r+1 r-1
x + ... + xn
2! (r - 1)!
n
Solution : Note : (a + x)n = ∑ ( nr ) a n -r
xr
(The right side of the equation is the sigma notation form of the binomial formula. I prefer to use this
so that the solution to be presented is as organized as possible. )
r=0

Step 1 : Base Case (Let n = 1)

(a + x)1 = ( 01 ) a 1-0
x0 + ( 11 ) a 1-1
x1
a+x = a+x (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

(a + x)k = ∑ ( kr ) a k-r
xr
r=0

Step 2.5 : Recall some formulas

n!
( nr ) =
r!·(n - r)!
(Consider this as this problem's Formula 1 .)

( n r+ 1 ) = (n + 1)!
r!·(n + 1 - r)!
=
(n + 1)·n !
r!·(n + 1 - r)·(k - r)!
(Refer to Schaum's Outline College Algebra Chapter 25 .)

( n r+ 1 ) = ( r n- 1 ) + ( nr ) (This formula is the Pascal's Identity .)

( nn ) = ( n0 ) = ( n 0+ y ) = 1 (This formula can be verified by using Formula 1 . Also let variable y be a constant lesser than n )
 Chapter 31: Solutions to Solved Problems
31.6 Problem : Prove the binomial formula
n (n - 1) n n (n - 1). . .(n - r + 2) n
(a + x)n = an + n an -1
+ a -2 2
x + ... + a -r+1 r-1
x + ... + xn
2! (r - 1)!

Solution : Step 3 : Prove by Induction (Let n = k + 1)

k+1

(a + x)k+1
= ∑ ( k +r 1 ) a k+1-r
xr
r=0

By recalling Step 2:

(a + x)k
= ∑ ( kr ) a k-r
xr
r=0

By using the Step 3's left side of the equation yields to:

(a + x)k + 1 = (a + x)1 (a + x)k

Substituting the equation of Step 2 from the above equation yields to:

(a + x)k + 1 = (a + x) ∑ ( kr ) a k-r
xr
r=0
 Chapter 31: Solutions to Solved Problems
31.6 Problem : Prove the binomial formula
n (n - 1) n n (n - 1). . .(n - r + 2) n
(a + x)n = an + n an -1
+ a -2 2
x + ... + a -r+1 r-1
x + ... + xn
2! (r - 1)!

Solution : Step 3 : Prove by Induction (Let n = k + 1)

(a + x)k + 1 = (a + x) [ ( 0k ) a k
x0 + ( 1k ) ak - 1 x1 + ( 2k ) ak - 2 x2 + ... + ( kk ) a 0
xk ]
(a + x)k + 1 = ( 0k ) ak + 1 + ( 1k ) ak x + ( 2k ) ak - 1 x2 + ... + ( kk ) a x k

k
+ ( 0k ) ak x + ( 1k ) ak - 1 x2 + ... + ( k-1 ) a xk + ( kk ) xk + 1

By using Pascal's Identity on the right side of the equation yields to:

k+1 k+1 k+1

(a + x)k + 1 = ( 0k ) ak + 1 + ( 1 ) ak x + ( 2 ) ak - 1 x2 + ... + ( k ) a xk + ( kk ) xk + 1

k+1 k+1
But ( 0k ) = ( 0 ) & ( kk ) = ( k + 1 ) , therefore:
k+1 k+1 k+1 k+1 k+1
(a + x)k + 1 = ( 0 ) ak + 1 + ( 1 ) ak x + ( 2 ) ak - 1 x2 + ... + ( k ) a xk + ( k+1 ) xk + 1

k
Answer : (a + x)k + 1 = (a + x) ∑ ( kr ) a k-r
xr (True)

r=0
 Chapter 31: Solutions to Solved Problems
31.6 Problem : Prove the binomial formula
n (n - 1) n n (n - 1). . .(n - r + 2) n
(a + x)n = an + n an -1
+ a -2 2
x + ... + a -r+1 r-1
x + ... + xn
2! (r - 1)!

Addendum : Let's prove Pascal's Identity:

( n r+ 1 ) = ( r n- 1 ) + ( nr )
( r n- 1 ) = n!
(r - 1)!·(n - r + 1)!

n!
( nr ) =
r!·(n - r)!

Using the right side of the Pascal's Identity:

( n r+ 1 ) = n!
(r - 1)!·(n - r + 1)!
+
n!
r!·(n - r)!

Note that:

n! n !·r
= (The first term of the right side of the equation is multiplied by r on both numerator and denominator .)
(r - 1)!·(n - r + 1)! r·(r - 1)!·(n - r + 1)!

n! n !· (n - r + 1) (The first term of the right side of the equation is multiplied by (n - r + 1) on both numerator and
=
r!·(n - r)! r!·(n - r)!·(n - r + 1) denominator .)
 Chapter 31: Solutions to Solved Problems
31.6 Problem : Prove the binomial formula
n (n - 1) n n (n - 1). . .(n - r + 2) n
(a + x)n = an + n an -1
+ a -2 2
x + ... + a -r+1 r-1
x + ... + xn
2! (r - 1)!

Addendum : Substituting yields to:

( n r+ 1 ) = n !·r
r·(r - 1)!·(n - r + 1)!
+
n !· (n - r + 1)
r!·(n - r)!·(n - r + 1)

( n r+ 1 ) = n !·r + n !·(n - r + 1)
r!·(n - r + 1)!
(From the definition of factorial we can say that r! = r·(r - 1)!)

( n r+ 1 ) = n !·r + n !·n - n !·r + n !

r!·(n - r + 1)!

( n r+ 1 ) = n !·n + n !
r!·(n - r + 1)!

( n r+ 1 ) = n !·(n + 1)
r!·[(n + 1) - r]!

Note that:

n !·(n + 1) = (n + 1)! (From the definition of factorial we can say that (n + 1)! = n !·(n + 1))

Therefore:

( n r+ 1 ) = (n + 1)!
r!·[(n + 1) - r]!
(Proved)
 Chapter 31: Solutions to Solved Problems
31.7 Problem : Prove by mathematical induction that the sum of the interior angles, S(n ), of a convex polygon is S(n ) = (n - 2)180°, where n is the number of
sides on the polygon.

Solution :

Step 1 : Base Case (Let n = 3) (The minimum number of sides to be consider a convex polygon is 3, which is known as the triangle .)

S(n ) = (n - 2)180°
= (3 - 2)180°
S(3) = 180° (This is true since it is known that the sum of the interior angles of a triangle is always equal to 180 degrees .)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

S(k) = (k - 2)180°

Step 2.5 : Proof by Algebraic Manipulation

P3 P4
P2
P5

P1
Pk

Pk + 1

S(k + 1) = S(k) + S(3)

(Based from the convex polygon above, it can be said that the angle sum is equal to S(k) plus angle sum of a
= (k - 2)180° + 180°
(triangle, which is S(3))
= S(k + 1) = (k - 1)180°
S(k + 1) = 180°k - 180°
 Chapter 31: Solutions to Solved Problems
31.7 Problem : Prove by mathematical induction that the sum of the interior angles, S(n ), of a convex polygon is S(n ) = (n - 2)180°, where n is the number of
sides on the polygon.

Solution :

Step 3 : Prove by Geometric Induction (Let n = k + 1)

P3 P4
P2
P5

P1
Pk

Pk + 1

Let the polygon be defined by the points P1, P2, P3, P4, P5, …, Pk, Pk + 1

Based from the polygon above, the angle sum of convex polygon P1P2P3P4P5…Pk is the formula of Step 2 which is S(k) = (k - 2)180°

Therefore it can be said that the angle sum of convex polygon P1P2P3P4P5…PkPk + 1 is S(k + 1) = [(k + 1) - 2]180°

Simplifying the equation for n = k + 1 yields to:

S(k + 1) = (k - 1)180°

Answer : S(k + 1) = 180°k - 180° (True) (Please refer to 31.7 - Pt. 1 )

 Chapter 31: Solutions to Solved Problems
31.8 Problem : Prove by mathematical induction that n 3 + 1 ≥ n 2 + n for all positive integers.

Solution :

Step 1 : Base Case (Let n = 1)

13 + 1 ≥ 12 + 1
1+1 ≥ 1+1
2 ≥ 2 (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

k3 + 1 ≥ k2 + k

Step 3 : Prove by Induction (Let n = k + 1)

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

By performing algebraic manipulations…:

k3 + 3k2 + 3k + 1 + 1
k3 + 2k2 + k2 + 3k + 2
(k3 + 2k2) + (k2 + 3k + 2)
(k3 + 2k2) + (k + 1)(k + 2)
(k3 + 2k2) + (k + 1)[(k + 1) + 1]
Answer : (k3 + 2k2) + (k + 1)2 + (k + 1)
≥ (k + 1)2 + (k + 1)
≥ (k + 1)2 + (k + 1)
≥ (k + 1)2 + (k + 1)
≥ (k + 1)2 + (k + 1)
≥ (k + 1)2 + (k + 1)
≥ (k + 1)2 + (k + 1) (True)

Conclusion : Since we assume that (k + 1)3 + 1 ≥ (k + 1)2 + (k + 1) is true, therefore at n = (k + 1) is also true because (k + 1) is greater than k.
 Chapter 31: Solutions to Solved Problems
31.9 Problem : Prove by mathematical induction that, for all positive integers n :
1 + 3 + 5 + . . . + (2n - 1) = n 2

Solution :

Step 1 : Base Case (Let n = 1)

1 = (1)2
1 = 1 (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

1 + 3 + 5 + . . . + (2k - 1) = k2

Step 3 : Prove by Induction (Let n = k + 1)

1 + 3 + 5 + . . . + (2k - 1) + [2(k + 1) - 1] = (k + 1)2

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

k2 + [2(k + 1) - 1] = (k + 1)2

By performing algebraic manipulations…:

k2 + 2k + 2 - 1 = (k + 1)2
k2 + 2k + 1 = (k + 1)2
(k + 1)(k + 1) = (k + 1)2
Answer : (k + 1)2 = (k + 1)2 (True)
 Chapter 31: Solutions to Solved Problems
31.10 Problem : Prove by mathematical induction that, for all positive integers n :
3n - 1
1 + 3 + 32 + . . . + 3n - 1 =
2

Solution :

Step 1 : Base Case (Let n = 1)

31 - 1
1 =
2
2
=
2

1 = 1 (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

3k - 1
1 + 3 + 32 + . . . + 3k - 1 =
2
 Chapter 31: Solutions to Solved Problems
31.10 Problem : Prove by mathematical induction that, for all positive integers n :
3n - 1
1 + 3 + 32 + . . . + 3n - 1 =
2

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

3k + 1 - 1
1 + 3 + 32 + . . . + 3k - 1 + 3(k + 1) - 1 =
2

By recalling Step 2:

3k - 1
1 + 3 + 32 + . . . + 3k - 1 =
2

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

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

By performing algebraic manipulations…:

3k - 1 + 2·3k 3k + 1 - 1
=
2 2
3·3k - 1 3k + 1 - 1
=
2 2
3k + 1 - 1 3k + 1 - 1
Answer : = (True)
2 2
 Chapter 31: Solutions to Solved Problems
31.11 Problem : Prove by mathematical induction that, for all positive integers n :
n 2(n + 1)2
13 + 23 + 33 + . . . + n 3 =
4

Solution :

Step 1 : Base Case (Let n = 1)

12(1 + 1)2
13 =
4
1·22
=
4
4
=
4

1 = 1 (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

k2(k + 1)2
13 + 23 + 33 + . . . + k3 =
4
 Chapter 31: Solutions to Solved Problems
31.11 Problem : Prove by mathematical induction that, for all positive integers n :
n 2(n + 1)2
13 + 23 + 33 + . . . + n 3 =
4

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

(k + 1)2[(k + 1) + 1]2
13 + 23 + 33 + . . . + k3 + (k + 1)3 =
4

By recalling Step 2:

k2(k + 1)2
13 + 23 + 33 + . . . + k3 =
4

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

k2(k + 1)2 (k + 1)2[(k + 1) + 1]2

+ (k + 1)3 =
4 4

By performing algebraic manipulations…:

k2(k + 1)2 + 4(k + 1)3 (k + 1)2[(k + 1) + 1]2

=
4 4
(k + 1)2[k2 + 4(k + 1)] (k + 1)2(k + 2)2
=
4 4
(k + 1)2(k2 + 4k + 4) (k + 1)2(k + 2)2
=
4 4
(k + 1) (k + 2)2
2
(k + 1) (k + 2)2
2
Answer : = (True)
4 4
 Chapter 31: Solutions to Solved Problems
31.12 Problem : Prove by mathematical induction that, for all positive integers n :
a(rn - 1)
a + ar + ar2 + . . . + arn -1 = , r≠1
r-1

Solution :

Step 1 : Base Case (Let n = 2)

a(r2 - 1)
a + ar =
r-1
a(r - 1)(r + 1)
=
r-1
= a(r + 1)
a + ar = a + ar (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

a(rk - 1)
a + ar + ar2 + . . . + ark-1 = , r≠1
r-1
 Chapter 31: Solutions to Solved Problems
31.12 Problem : Prove by mathematical induction that, for all positive integers n :
a(rn - 1)
a + ar + ar2 + . . . + arn -1 = , r≠1
r-1

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

a(rk + 1 - 1)
a + ar + ar2 + . . . + ark-1 + ar(k + 1) - 1 = , r≠1
r-1

By recalling Step 2:

a(rk - 1)
a + ar + ar2 + . . . + ark-1 = , r≠1
r-1

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

a(rk - 1) a(rk + 1 - 1)
+ ar(k + 1) - 1 =
r-1 r-1

By performing algebraic manipulations…:

a(rk - 1) a(rk + 1 - 1)
+ ark =
r-1 r-1
a(rk - 1) + ark(r - 1) a(rk + 1 - 1)
=
r-1 r-1
ark - a + ark+1 - ark a(rk + 1 - 1)
=
r-1 r-1
k+1 k+1
- a + ar a(r - 1)
=
r-1 r-1
k+1 k+1
a(r - 1) a(r - 1)
Answer : = (True)
r-1 r-1
 Chapter 31: Solutions to Solved Problems
31.13 Problem : Prove by mathematical induction that, for all positive integers n :
1 1 1 1 n
+ + + ... + =
1·2 2·3 3·4 n (n + 1) n +1

Solution :

Step 1 : Base Case (Let n = 1)

1 1
=
1·2 1+1
1 1
= (True)
2 2

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

1 1 1 1 k
+ + + ... + =
1·2 2·3 3·4 k(k + 1) k+1
 Chapter 31: Solutions to Solved Problems
31.13 Problem : Prove by mathematical induction that, for all positive integers n :
1 1 1 1 n
+ + + ... + =
1·2 2·3 3·4 n (n + 1) n +1

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

1 1 1 1 1 k+1
+ + + ... + + =
1·2 2·3 3·4 k(k + 1) (k + 1)[(k + 1) + 1] (k + 1) + 1

By recalling Step 2:

1 1 1 1 k
+ + + ... + =
1·2 2·3 3·4 k(k + 1) k+1

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

k 1 k+1
+ =
k+1 (k + 1)[(k + 1) + 1] (k + 1) + 1

By performing algebraic manipulations…:

k 1 k+1
+ =
k+1 (k + 1)(k + 2) (k + 1) + 1
k(k + 2) + 1 k+1
=
(k + 1)(k + 2) (k + 1) + 1
k2 + 2k + 1 k+1
=
(k + 1)(k + 2) (k + 1) + 1
(k + 1)(k + 1) k+1
=
(k + 1)(k + 2) (k + 1) + 1
(k + 1) k+1
=
(k + 2) (k + 1) + 1
(k + 1) k+1
Answer : = (True)
(k + 1) + 1 (k + 1) + 1
 Chapter 31: Solutions to Solved Problems
31.14 Problem : Prove by mathematical induction that, for all positive integers n :
(2n - 1)3n + 1 + 3
1 · 3 + 2 · 32 + 3 · 33 + . . . n · 3n =
4

Solution :

Step 1 : Base Case (Let n = 1)

[2(1) - 1]3(1) + 1 + 3
1·3 =
4
(2 - 1)32 + 3
1·3 =
4
(1)32 + 3
1·3 =
4
(1)9 + 3
1·3 =
4
12
1·3 =
4

3 = 3 (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

(2k - 1)3k +1
+3
1 · 3 + 2 · 32 + 3 · 33 + . . . k · 3k =
4
 Chapter 31: Solutions to Solved Problems
31.14 Problem : Prove by mathematical induction that, for all positive integers n :
(2n - 1)3n + 1 + 3
1 · 3 + 2 · 32 + 3 · 33 + . . . n · 3n =
4

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

[2(k + 1) - 1]3(k + 1) +1
+3
1 · 3 + 2 · 32 + 3 · 33 + . . . k · 3k + (k + 1) · 3(k + 1) =
4

By recalling Step 2:

(2k - 1)3k +1
+3
1 · 3 + 2 · 32 + 3 · 33 + . . . k · 3k =
4

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

(2k - 1)3k +1
+3 [2(k + 1) - 1]3(k + 1) +1
+3
+ (k + 1) · 3(k + 1) =
4 4

By performing algebraic manipulations…:

(2k - 1)3k + 1 + 3 + 4(k + 1) · 3(k + 1) [2(k + 1) - 1]3(k + 1) + 1 + 3

=
4 4
(2k - 1)3k + 1 + 3 + (4k + 4) · 3(k + 1) (2k + 2 - 1)3k + 2 + 3
=
4 4
3k + 1(2k - 1 + 4k + 4) + 3 (2k + 1)3k + 2 + 3
=
4 4
k+1 k+2
3 (6k + 3) + 3 3 (2k + 1) + 3
=
4 4
k+2 k+2
3 (2k + 1) + 3 3 (2k + 1) + 3
Answer : = (True)
4 4
 Chapter 31: Solutions to Solved Problems
31.15 Problem : Prove by mathematical induction that, for all positive integers n :
1 1 1 1 n
+ + + ... + =
2·5 5·8 8 · 11 (3n - 1)(3n + 2) 6n + 4

Solution :

Step 1 : Base Case (Let n = 1)

1 1
=
2·5 6(1) + 4
1 1
=
2·5 6+4
1 1
= (True)
10 10

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

1 1 1 1 k
+ + + ... + =
2·5 5·8 8 · 11 (3k - 1)(3k + 2) 6k + 4
 Chapter 31: Solutions to Solved Problems
31.15 Problem : Prove by mathematical induction that, for all positive integers n :
1 1 1 1 n
+ + + ... + =
2·5 5·8 8 · 11 (3n - 1)(3n + 2) 6n + 4

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

1 1 1 1 1 k+1
+ + + ... + + =
2·5 5·8 8 · 11 (3k - 1)(3k + 2) [3(k + 1) - 1][3(k + 1) + 2] 6(k + 1) + 4

By recalling Step 2:

1 1 1 1 k
+ + + ... + =
2·5 5·8 8 · 11 (3k - 1)(3k + 2) 6k + 4

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

k 1 k+1
+ =
6k + 4 [3(k + 1) - 1][3(k + 1) + 2] 6(k + 1) + 4

By performing algebraic manipulations…:

k 1 k+1
+ =
6k + 4 (3k + 3 - 1)(3k + 3 + 2) 6(k + 1) + 4
k 1 k+1
+ =
6k + 4 (3k + 2)(3k + 5) 6k + 6 + 4
k 1 k+1
+ =
2(3k + 2) (3k + 2)(3k + 5) 6k + 10
k(3k + 5) + 2 k+1
=
2(3k + 2)(3k + 5) 2(3k + 5)
3k2 + 5k + 2 k+1
= (Factors of 3k2 + 5k + 2 are both 3k + 2 and k + 1)
2(3k + 2)(3k + 5) 2(3k + 5)
(k + 1) k+1
Answer : = (True)
2(3k + 5) 2(3k + 5)
 Chapter 31: Solutions to Solved Problems
31.16 Problem : Prove by mathematical induction that, for all positive integers n :
1 1 1 1 n (n + 3)
+ + + ... + =
1·2·3 2·3·4 3·4·5 n (n + 1)(n + 2) 4(n + 1)(n + 2)

Solution :

Step 1 : Base Case (Let n = 1)

1 1(1 + 3)
=
1·2·3 4(1 + 1)(1 + 2)
1 1(4)
=
1·2·3 4(2)(3)
1 1
=
1·2·3 (2)(3)
1 1
= (True)
(2)(3) (2)(3)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

1 1 1 1 k(k + 3)
+ + + ... + =
1·2·3 2·3·4 3·4·5 k(k + 1)(k + 2) 4(k + 1)(k + 2)
 Chapter 31: Solutions to Solved Problems
31.16 Problem : Prove by mathematical induction that, for all positive integers n :
1 1 1 1 n (n + 3)
+ + + ... + =
1·2·3 2·3·4 3·4·5 n (n + 1)(n + 2) 4(n + 1)(n + 2)

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

1 1 1 1 1 (k + 1)[(k + 1) + 3]
+ + + ... + + =
1·2·3 2·3·4 3·4·5 k(k + 1)(k + 2) (k + 1)[(k + 1) + 1][(k + 1) + 2] 4[(k + 1) + 1][(k + 1) + 2]

By recalling Step 2:

1 1 1 1 k(k + 3)
+ + + ... + =
1·2·3 2·3·4 3·4·5 k(k + 1)(k + 2) 4(k + 1)(k + 2)

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

k(k + 3) 1 (k + 1)[(k + 1) + 3]
+ =
4(k + 1)(k + 2) (k + 1)[(k + 1) + 1][(k + 1) + 2] 4[(k + 1) + 1][(k + 1) + 2]

By performing algebraic manipulations…:

k(k + 3) 1 (k + 1)(k + 4)
+ =
4(k + 1)(k + 2) (k + 1)(k + 2)(k + 3) 4(k + 2)(k + 3)
k(k + 3)(k + 3) + 4 (k + 1)(k + 4)
=
4(k + 1)(k + 2)(k + 3) 4(k + 2)(k + 3)
k3 + 6k2 + 9k + 4 (k + 1)(k + 4)
=
4(k + 1)(k + 2)(k + 3) 4(k + 2)(k + 3)
k + 2k2 + k + 4k2 + 8k + 4
3
(k + 1)(k + 4)
= Note: 6k2 = 2k2 + 4k2 and 9k = k + 8k
4(k + 1)(k + 2)(k + 3) 4(k + 2)(k + 3)
k(k + 2k + 1) + 4(k2 + 2k + 1)
2
(k + 1)(k + 4)
=
4(k + 1)(k + 2)(k + 3) 4(k + 2)(k + 3)
 Chapter 31: Solutions to Solved Problems
31.16 Problem : Prove by mathematical induction that, for all positive integers n :
1 1 1 1 n (n + 3)
+ + + ... + =
1·2·3 2·3·4 3·4·5 n (n + 1)(n + 2) 4(n + 1)(n + 2)

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

Continuation: By performing algebraic manipulations…:

k(k + 1)2 + 4(k + 1)2 (k + 1)(k + 4)

=
4(k + 1)(k + 2)(k + 3) 4(k + 2)(k + 3)
(k + 1)2(k + 4) (k + 1)(k + 4)
=
4(k + 1)(k + 2)(k + 3) 4(k + 2)(k + 3)
(k + 1)(k + 4) (k + 1)(k + 4)
Answer : = (True)
4(k + 2)(k + 3) 4(k + 2)(k + 3)
 Chapter 31: Solutions to Solved Problems
31.17 Problem : Prove by mathematical induction that an - bn is divisible by a - b when n = positive integer.

Solution :

Step 1 : Base Case (Let n = 1)

a(1) - b(1)
= N (Let N be the quotient )
a-b
a1 - b1
= N
a-b
a-b
= N
a-b
1 = N (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

ak - bk
= M (Let M be the quotient )
a-b
ak - bk = M(a - b)
ak = M(a - b) + bk
 Chapter 31: Solutions to Solved Problems
31.17 Problem : Prove by mathematical induction that an - bn is divisible by a - b when n = positive integer.

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

a(k + 1) - b(k + 1)
= L (Let L be the quotient )
a-b

By recalling Step 2:

ak = M(a - b) + bk

ak·a - bk·b = L(a - b)

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

a·[M(a - b) + bk] - bk·b = L(a - b)

By performing algebraic manipulations…:

aM(a - b) + abk - bk·b = L(a - b)

aM(a - b) + bk(a - b) = L(a - b)

Dividing both sides of the equation by (a - b) yields to:

Answer : aM + bk = L (True)
 Chapter 31: Solutions to Solved Problems
31.18 Problem : Prove by mathematical induction that a2n -1
+ b2n -1
is divisible by a + b, for n = positive integer.

Solution :

Step 1 : Base Case (Let n = 1)

a2(1) - 1 + b2(1) - 1
= N (Let N be the quotient )
a+b
a2 - 1 + b2 - 1
= N
a+b
a1 + b1
= N
a+b
a+b
= N
a+b
1 = N (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

a2k -1
+ b2k - 1
= M (Let M be the quotient )
a+b
2k - 1
a + b2k - 1 = M(a + b)
2k - 1
a - b2k - 1 = M(a + b)
a2ka-1 + b2kb-1 = M(a + b)
a2ka-1 = M(a + b) - b2kb-1

Multiplying both sides of the equation by a:

a2k = aM(a + b) - ab2kb-1

 Chapter 31: Solutions to Solved Problems
31.18 Problem : Prove by mathematical induction that a2n -1
+ b2n -1
is divisible by a + b, for n = positive integer.

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

a2(k + 1) - 1 + b2(k+ 1) - 1
= L (Let L be the quotient )
a+b

By recalling Step 2:

a2k = aM(a + b) - ab2kb-1

a2k + 2 - 1 + b2k + 2 - 1 = L(a + b)

a2k + 1 + b2k + 1 = L(a + b)
a2ka + b2kb = L(a + b)

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

a·[aM(a + b) - ab2kb-1] + b2k·b = L(a + b)

By performing algebraic manipulations…:

a2M(a + b) - a2b2kb-1 + b2k·b = L(a + b)

a2M(a + b) - b2k(a2b-1 - b)
a2M(a + b) - b2k(a2 - b2)
= L(a + b)
b
a2M(a + b) - b2k - 1(a2 - b2) = L(a + b)
a2M(a + b) - b2k - 1(a + b)(a - b) = L(a + b)

Dividing both sides of the equation by (a + b) yields to:

Answer : a2M + b2k - 1(a - b) = L (True)

 Chapter 31: Solutions to Solved Problems
31.19 Problem : Prove by mathematical induction that, for all positive integers n :
n (n + 1)(n + 2)(n + 3)
1 · 2 · 3 + 2 · 3 · 4 + . . . + n (n + 1)(n + 2) =
4

Solution :

Step 1 : Base Case (Let n = 1)

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

1·2·3 =
4
1(2)(3)(4)
=
4
1·2·3 = 1(2)(3)
6 = 6 (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

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

1·2·3 + 2·3·4 + ... + k(k + 1)(k + 2) =
4
 Chapter 31: Solutions to Solved Problems
31.19 Problem : Prove by mathematical induction that, for all positive integers n :
n (n + 1)(n + 2)(n + 3)
1 · 2 · 3 + 2 · 3 · 4 + . . . + n (n + 1)(n + 2) =
4

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

(k + 1)[(k + 1) + 1][(k + 1) + 2][(k + 1) + 3]

1·2·3 + 2·3·4 + ... + k(k + 1)(k + 2) + (k + 1)[(k + 1) + 1][(k + 1) + 2] =
4

By recalling Step 2:

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

1·2·3 + 2·3·4 + ... + k(k + 1)(k + 2) =
4

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

k(k + 1)(k + 2)(k + 3) (k + 1)[(k + 1) + 1][(k + 1) + 2][(k + 1) + 3]

+ (k + 1)[(k + 1) + 1][(k + 1) + 2] =
4 4

By performing algebraic manipulations…:

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

+ (k + 1)(k + 2)(k + 3) =
4 4
(k + 1)(k + 2)(k + 3)·(k + 4) (k + 1)(k + 2)(k + 3)(k + 4)
Answer : = (True)
4 4
 Chapter 31: Solutions to Solved Problems
31.20 Problem : Prove by mathematical induction that, for all positive integers n :
1 + 2 + 22 + . . . + 2n - 1 = 2n - 1

Solution :

Step 1 : Base Case (Let n = 1)

1 = 2(1) - 1
1 = 2-1
1 = 1 (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

1 + 2 + 22 + . . . + 2k - 1 = 2k - 1

Step 3 : Prove by Induction (Let n = k + 1)

1 + 2 + 22 + . . . + 2k - 1 + 2(k + 1) - 1 = 2(k + 1) - 1

By recalling Step 2:

1 + 2 + 22 + . . . + 2k - 1 = 2k - 1

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

2k - 1 + 2(k + 1) - 1 = 2(k + 1) - 1

By performing algebraic manipulations…:

2k - 1 + 2k = 2(k + 1) - 1
2·2k - 1 = 2(k + 1) - 1 (Note that adding 2k to 2k is equal to 2·2k)
21·2k - 1 = 2(k + 1) - 1
Answer : 2(k + 1) - 1 = 2(k + 1) - 1 (True)
 Chapter 31: Solutions to Solved Problems
31.21 Problem : Prove by mathematical induction that, for n = a positive integer:
(ab)n = an bn

Solution :

Step 1 : Base Case (Let n = 1)

(ab)1 = a1b1
a1b1 = a1b1
ab = ab (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

(ab)k = akbk

Step 3 : Prove by Induction (Let n = k + 1)

(ab)(k + 1) = (a(k + 1))(b(k + 1))

By performing algebraic manipulations…:

(ab)k(ab)1 = (a(k + 1))(b(k + 1))

ak·a1bk·b1 = (a(k + 1))(b(k + 1))
Answer : (a(k + 1))(b(k + 1)) = (a(k + 1))(b(k + 1)) (True)
 Chapter 31: Solutions to Solved Problems
31.22 Problem : Prove by mathematical induction that, for n = a positive integer:
a n an
( )
b
=
bn ( )
Solution :

Step 1 : Base Case (Let n = 1)

a 1 a1
( )
b
= ( )
b1
a1 a1
=
b1 b1
a a
= (True)
b b

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

a k ak
( )b
= ( )
bk

Step 3 : Prove by Induction (Let n = k + 1)

(k + 1)

( ba ) (k + 1) = ( ba ) (k + 1)

By performing algebraic manipulations…:

( ba ) k ( ba ) 1
k 1 (k + 1)

( ba ·a·b ) = ( ba )
k 1

(k + 1)
(k + 1)

(k + 1)
a
Answer : (
b ) = ( ba )
(k + 1) (k + 1) (True)
 Chapter 31: Solutions to Solved Problems
31.23 Problem : Prove by mathematical induction that, for all positive integers n :
n 2 + n is even

Solution :

Step 1 : Base Case (Let n = 1)

(1)2 + 1 = E (Let E be an even number )

12 + 1 = E
2 = E (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

k2 + k
= F (Also assume that the expression k2 + k is divisible by 2 and let F be the quotient )
2
k2 + k = 2F
 Chapter 31: Solutions to Solved Problems
31.23 Problem : Prove by mathematical induction that, for all positive integers n :
n 2 + n is even

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

(k + 1)2 + (k + 1) = G (Let G be an another even number )

By recalling Step 2:

k2 + k = 2F

Using the equation of Step 3 yields to:

k2 + 2k + 1 + k + 1 = G

Rearrange the left side of the equation:

k2 + k + 2k + 1 + 1 = G

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

2F + 2k + 1 + 1 = G

By performing algebraic manipulations…:

Answer : 2F + 2k + 2 = G (True) (All positive numbers multiplied by 2 are considered even numbers. )
 Chapter 31: Solutions to Solved Problems
31.24 Problem : Prove by mathematical induction that, for all positive integers n :
n 3 + 5n is divisible by 3

Solution :

Step 1 : Base Case (Let n = 1)

(1)3 + 5(1)
= N (Let N be the quotient )
3
1+5
= N
3
6
= N
3
2 = N (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

k3 + 5k
= M (Let M be the quotient )
3
k3 + 5k = 3M
k3 = 3M - 5k
 Chapter 31: Solutions to Solved Problems
31.24 Problem : Prove by mathematical induction that, for all positive integers n :
n 3 + 5n is divisible by 3

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

(k + 1)3 + 5(k + 1)
= L (Let L be the quotient )
3

By recalling Step 2:

k3 = 3M - 5k

k3 + 3k2 + 3k + 1 + 5k + 5 = 3L

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

(3M - 5k) + 3k2 + 3k + 1 + 5k + 5 = 3L

By performing algebraic manipulations…:

3M + 3k2 + 3k + 6 = 3L

Dividing both sides of the equation by 3 yields to:

Answer : M + k2 + k + 2 = L (True)
 Chapter 31: Solutions to Solved Problems
31.25 Problem : Prove by mathematical induction that, for all positive integers n :
5n - 1 is divisible by 4

Solution :

Step 1 : Base Case (Let n = 1)

5(1) - 1
= N (Let N be the quotient )
4
5-1
= N
4
4
= N
4
1 = N (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

5k - 1
= M (Let M be the quotient )
4
5k - 1 = 4M
5k = 4M + 1
 Chapter 31: Solutions to Solved Problems
31.25 Problem : Prove by mathematical induction that, for all positive integers n :
5n - 1 is divisible by 4

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

5(k + 1) - 1
= L (Let L be the quotient )
4

By recalling Step 2:

5k = 4M + 1

5k·51 - 1 = 4L

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

(4M + 1)·5 - 1 = 4L

By performing algebraic manipulations…:

20M + 5 - 1 = 4L
20M + 4 = 4L

Dividing both sides of the equation by 4 yields to:

Answer : 5M + 1 = L (True)
 Chapter 31: Solutions to Solved Problems
31.26 Problem : Prove by mathematical induction that, for all positive integers n :
4n - 1 is divisible by 3

Solution :

Step 1 : Base Case (Let n = 1)

4(1) - 1
= N (Let N be the quotient )
3
4-1
= N
3
3
= N
3
1 = N (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

4k - 1
= M (Let M be the quotient )
3
4k - 1 = 3M
4k = 3M + 1
 Chapter 31: Solutions to Solved Problems
31.26 Problem : Prove by mathematical induction that, for all positive integers n :
4n - 1 is divisible by 3

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

4(k + 1) - 1
= L (Let L be the quotient )
3

By recalling Step 2:

4k = 3M + 1

4k·41 - 1 = 3L

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

(3M + 1)·4 - 1 = 3L

By performing algebraic manipulations…:

12M + 4 - 1 = 3L
12M + 3 = 3L

Dividing both sides of the equation by 3 yields to:

Answer : 4M + 1 = L (True)
 Chapter 31: Solutions to Solved Problems
31.27 Problem : Prove by mathematical induction that, for all positive integers n :
n (n + 1)(n + 2) is divisible by 6

Solution :

Step 1 : Base Case (Let n = 1)

(1)[(1) + 1][(1) + 2]
= N (Let N be the quotient )
6
1(2)(3)
= N
6
6
= N
6
1 = N (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

k(k + 1)(k + 2)
= M (Let M be the quotient )
6
k(k + 1)(k + 2) = 6M
 Chapter 31: Solutions to Solved Problems
31.27 Problem : Prove by mathematical induction that, for all positive integers n :
n (n + 1)(n + 2) is divisible by 6

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

(k + 1)[(k + 1) + 1][(k + 1) + 2]
= L (Let L be the quotient )
6

By recalling Step 2:

k(k + 1)(k + 2) = 6M

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

Multiplying (k + 3) to (k + 1)(k + 2) that yields to:

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

Substitute the equation of Step 2 to the equation of Step 3 that yields to:

6M + 3(k + 1)(k + 2) = 6L

Addendum: Prove that (k + 1)(k + 2) is divisible by 2:

Step 1.1 : Base Case (Let n = 1)

[(1) + 1][(1) + 2]
= A (Let A be the quotient )
2
(2)(3)
= A
2
6
= A
2
3 = A (True)
 Chapter 31: Solutions to Solved Problems
31.27 Problem : Prove by mathematical induction that, for all positive integers n :
n (n + 1)(n + 2) is divisible by 6

Solution :

Step 2.1 : Inductive Hypothesis (Let k = j) and assume this is already true

(j + 1)(j + 2)
= B (Let B be the quotient )
2
(j + 1)(j + 2) = 2B
(j2 + j + 2j + 2) = 2B
j2 + 3j + 2 = 2B
j2 = 2B - 3j - 2

Step 3.1 : Prove by Induction (Let k = j + 1)

[(j + 1) + 1][(j + 1) + 2]
= C (Let B be the quotient )
2

By recalling Step 2.1:

j2 = 2B - 3j - 2

(j + 2)(j + 3) = 2C

By performing algebraic manipulations…:

(j2 + 2j + 3j + 6) = 2C
j2 + 5j + 6) = 2C

Substitute the equation of Step 2.1 to the equation of Step 3.1 that yields to:

(2B - 3j - 2) + 5j + 6 = 2C
2B + 2j + 4 = 2C (True) (Each term has an even number multiplier which makes (k + 1)(k + 2) divisible by 2 )
 Chapter 31: Solutions to Solved Problems
31.27 Problem : Prove by mathematical induction that, for all positive integers n :
n (n + 1)(n + 2) is divisible by 6

Solution :

Step 3 : Prove by Induction (Let n = k + 1) Continuation…

6M + 3(k + 1)(k + 2) = 6L

Substitute the equation of Step 3.1 to the equation of Step 3 that yields to:

6M + 3(2C) = 6L

By performing algebraic manipulations…:

6M + 6C = 6L

Dividing both sides of the equation by 6 yields to:

Answer : M+C = L (True)

 Chapter 31: Solutions to Solved Problems
31.28 Problem : Prove by mathematical induction that, for all positive integers n :
n (n + 1)(n + 2)(n + 3) is divisible by 24

Solution :

Step 1 : Base Case (Let n = 1)

(1)[(1) + 1][(1) + 2][(1) + 3]

= N (Let N be the quotient )
24
1(2)(3)(4)
= N
24
24
= N
24
1 = N (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

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

= M (Let M be the quotient )
24
k(k + 1)(k + 2)(k + 3) = 24M
 Chapter 31: Solutions to Solved Problems
31.28 Problem : Prove by mathematical induction that, for all positive integers n :
n (n + 1)(n + 2)(n + 3) is divisible by 24

Solution :

Step 3 : Prove by Induction (Let n = k + 1)

(k + 1)[(k + 1) + 1][(k + 1) + 2][(k + 1) + 3]

= L (Let L be the quotient )
24

By recalling Step 2:

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

(k + 1)(k + 2)(k + 3)(k + 4) = 24L Eq. 1

We know that (k + 1)(k + 2)(k + 3) is divisible by 6 by looking at 31.27 - Pt. 2, 31.27 - Pt. 3, and 31.27 - Pt. 4, therefore:

(k + 1)(k + 2)(k + 3) = 24A Eq. 2 (Let A be the quotient )

Substituting Eq. 2 to Eq. 1 yields to:

(24A)·(k + 4) = 24L

Dividing both sides of the equation by 24 yields to:

Answer : A(k + 4) = 24L (True)

 Chapter 31: Solutions to Solved Problems
31.29 Problem : Prove by mathematical induction that n 2 + 1 > n for all positive integers.

Solution :

Step 1 : Base Case (Let n = 1)

12 + 1 > 1
1+1 > 1
2 > 1 (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

k2 + 1 > k

Step 3 : Prove by Induction (Let n = k + 1)

(k + 1)2 + 1 > (k + 1)

By performing algebraic manipulations…:

k2 + 2k + 1 + 1 > (k + 1)
k2 + 2k + 2 > (k + 1)
Answer : k2 + 2(k + 1) > (k + 1) (True)

Conclusion : Since we assume that (k + 1)2 + 1 > (k + 1) is true, therefore at n = (k + 1) is also true because (k + 1) is greater than k.
 Chapter 31: Solutions to Solved Problems
31.30 Problem : Prove by mathematical induction that 2n ≥ n + 1 for all positive integers.

Solution :

Step 1 : Base Case (Let n = 1)

2(1) ≥ 1 + 1
2 ≥ 2 (True)

Step 2 : Inductive Hypothesis (Let n = k) and assume this is already true

2k ≥ k+1

Step 3 : Prove by Induction (Let n = k + 1)

2(k + 1) ≥ (k + 1) + 1

Since assuming that n = k, therefore k = (k + 1):

2(k + 1) ≥ (k + 1) + 2

By performing algebraic manipulations…:

Answer : 2(k + 1) ≥ (k + 1) + 2 (True)

Conclusion : Since we assume that 2k ≥ (k + 1) is true, therefore at n = (k + 1) is also true because (k + 1) is greater than k.