MATHEMATICA

CHAPTER 4 L INDUCTIONS

Chapter 4 1
Chapter 4 Overview
4.1 Intro to Mathematical Induction
4.2 Principle of Mathematical Induction

Chapter 4 2
4.1 Mathematical Induction
• Mathematical induction can be used to prove statements that assert
that P(n) is true for all positives integers n, where P(n) is a
propositional function.

• Mathematical induction proofs has two parts:

1) Basis Step: The proposition P(1) is true
2) Inductive Step: The implication
If P(n) is true, then P(n+1) is true for all
positive n.
- Therefore, we conclude ∀xP(x)

Link video contain explanation: https://youtu.be/mMtviwfbepw

Chapter 4 3
4.2 Principle of Mathematical Induction
• Consider a list p(1), p(2), p(3), …. .of propositions indexed by P.
All the propositions p(n) are true provided that

• (B) : the fact that when n is replace by 1 in p(n) , p(1) is

true (LHS=RHS) – (Basic Step)
• (I) : By assuming that p(n) is true, then we have to show that
p(n+1) must also be true. Equivalently, p(n)  p(n+1) is
true for all n  P. In other word, we have to establish a
formula for p(n+1), and then we show LHS=RHS – (Inductive
Step)

• (LHS = ‘left hand side’, RHS = ’right hand side’)

Chapter 4 4
Example 4.1
Prove that 1 + 3 + 5 + … + (2n-1) = n2 , for all n  N.

Link video contain explanation: https://youtu.be/ZseROrOvmGU

ANSWER:
Basic Step:
Take n=1, LHS =2(1) –1 =1. RHS=12=1 , Therefore LHS=RHS
Take n=2, LHS =1 + [2(2) –1] =4. RHS=22= 4 , Therefore LHS=RHS

Inductive Step:
p(n)  p(n+1) is true for all n  P.
p(n) : 1 + 3 + 5 + … + (2n-1) = n2 is true for all n  P , then we have to prove
p(n+1) : 1 + 3 + 5 + … + (2n-1) + [2(n+1)-1]= (n+1)2 is true for all n  P .

Proof:
1 + 3 + 5 + … + (2n-1) + [2(n+1)-1] = 1 + 3 + 5 + … + (2n-1) + [2n+2-1]
___from p(n)______ + [ 2n +1 ]
= n2 + 2n + 1
= n + 2n + 1
2

= ( n + 1 )2 = RHS - proved.

Chapter 4 5
Example 4.2
Prove that 1 + 2 + 3 + …. + n = [n(n+1)] / 2 , for all n  N.
Link video contain explanation: https://youtu.be/70Zq5I908tc
ANSWER:
Basic Step:
Take n=1, LHS= 1 RHS =[1(1+1)] / 2=1(2) /2 =1. Therefore LHS=RHS
Take n=2, LHS =1+2=3 RHS =[2(2+1)] / 2=[2(3)] /2 =3. Therefore LHS=RHS

Inductive Step:
p(n)  p(n+1) is true for all n  P , then
p(n) : 1 + 2 + 3 +…. + n=[n(n+1)] / 2 is true for all nP ,then we have to prove
p(n+1) : 1 + 2 +3 + … + n + (n+1)= [ (n+1){(n+1)+1 }] / 2 is true for all n  P .
= [ (n+1)(n+2) ] /2 is true for all n  P
Proof:
1 + 2 +3 + … + n + (n+1) = 1 + 2 +3 + … + n + (n+1)
• = ___ from p(n) ___ + (n + 1)
• = [n(n+1)] / 2 + n+1
• = [n(n+1)] / 2 + 2( n + 1)/2
• = [ n(n+1) + 2n + 2] / 2
• = [ n2 +n + 2n + 2 ] / 2
• = [ n2 + 3n + 2 ] / 2
• = [ (n+1)(n+2) ] /2 = RHS -- proved.

Chapter 4 6
 Example 4.3
Prove that , for all n  N.
Video link contain explanation : https://youtu.be/6lvM3TzmMCo
ANSWER:
• Ans:
• Basic Step:
• Take k=1, n=1 LHS= 3(1)-2=1 : RHS =[3(1 2)-1]/2= 2 /2 =1. Therefore LHS=RHS
• Take k=1, n=2, LHS =[3(1)-2] + [3(2)-2]=1 + 4 =5 : RHS =[3(2 2)-2]/2= 10/2=5 .
• Therefore LHS=RHS
• 
• Inductive Step:
• p(n)  p(n+1) is true for all n  P.
• n

• p(n):  (3k – 2 ) = (3n2 –n ) /2 is true for all n  P , then we have to prove

• k=1

• n+1

• p(n+1):  (3k – 2 ) = [3(n+1)2 –(n+1)] /2 for all n  P.

• k=1

• Proof:
• n+1 n

• LHS =  (3k – 2 ) =  (3k – 2 ) + [3(n+1) –2]

• k=1 k=1

• = _from p(n)_ + [3n +1]

• = (3n2 –n ) /2 + [3n +1]
• = (3n2 –n ) /2 + (2[3n +1])/2
• = {(3n2 –n ) + 2[3n +1] } / 2
• = {(3n2 –n + 6n +2)} / 2
• = [3n2 + 5n +2 ] / 2
• 
• RHS = [3(n+1)2 –(n+1)] /2
• = [3(n2 +2n +1)–(n+1)] /2
• = [3n2 + 6n +3 – n-1)] /2
• = [3n2 + 5n + 2)] /2
• Therefore LHS = RHS , proved.
• 

Chapter 4 7
Example 4.4
Prove that for all n  N, r≠1.
Video link contain explanation: https://youtu.be/v4fO7RTxJGk

Ans:
Basic Step:
Take j=n=0, LHS= a : RHS =(ar0+1–a) / (r-1) =(ar–a) / (r-1) =a(r–1) / (r-1)=a
Therefore LHS=RHS
Take n=1, LHS = a + ar : RHS =(ar1+1–a) / (r-1) =(ar2–a) / (r-1) =a(r2–1) / (r-1)
= a(r+1)(r –1) / (r-1) =a (r+1)= a + ar. Therefore LHS=RHS
Inductive Step:
p(n)  p(n+1) is true for all n  P.
n
p(n):  arj = (arn+1 – a) / (r-1) for all n  P, r  1, then we have to prove
j=0

n+1
p(n+1):  arj = [ar(n+1)+1 – a ] / (r-1) for all n  P, r  1.
j=0

= [arn+2 – a ] / (r-1)
Proof:
n+1 n
LHS=  arj =  arj + arn+1
j=0 j=0

=_from p(n)_ + arn+1

= [arn+1 – a ] / (r-1) + arn+1
= { [arn+1 – a ] + arn+1 (r-1)} / (r-1)
= [arn+1 – a + arn+2 - arn+1 ] / (r-1)
= [arn+2 – a ] / (r-1) = RHS , proved.

Chapter 4 8
Example 4.5
Use mathematical induction to show that 1 + 2 + 22 + 23 + ... + 2n = 2n+1 – 1 for all n  N.

ANSWER:
Basic Step:
Take n=0, LHS= 20=1 : RHS =20+1–1=1 , Therefore LHS=RHS
Take n=1, LHS =20+21 =1+2=3: RHS ==(21+1–1) =22–1= 3 .
Therefore LHS=RHS

Inductive Step:
p(n)  p(n+1) is true for all n  N.
p(n): 1 + 2 + 22 + 32 + ….. + 2n = 2n+1 – 1 for all n  N , then we have to prove
p(n+1): 1 + 2 + 22 + 32 + ….. + 2n + 2n+1 = 2(n+1)+1 – 1 for all n  N .
= 2n+2 – 1 for all n  N .
Proof:
LHS =1 + 2 + 22 + 32 + ….. + 2n + 2n+1
=_____from p(n)________ + 2n+1
= 2n+1 – 1 + 2n+1 (Hint: G + G = 2G where G=2n+1)
= 2. 2n+1 – 1 = 21.2n .21 – 1 = 2n+2 – 1 = RHS , proved.
Chapter 4 9
Divisible
• Any number that are divisible by a number to get a result
of an integer (Z):
i) number that divisible by 3 :
number /3 = k, k  Z
number = 3k, k  Z (in other word, multiple of 3).

ii) number that divisible by 7 :

number /7 = m, m  Z
number = 7m, m  Z (in other word, multiple of 7).
• Video link contain explanation: https://youtu.be/Zzez9DCZoeA

Chapter 4 10
Example 4.6
Prove that n3- n is divisible by 3 for all n  N.
ANSWER:
Basic Step:
Take n=1, LHS= 13-1=0: 0 is divisible by 3
Take n=2, LHS =23- 2 =6 =3x2 , 6 is divisible by 3.
Take n=3, LHS =33- 3 =24 =3x8 , 24 is divisible by 3.
Inductive Step:
p(n)  p(n+1) is true for all n  N.
p(n): (n3- n)/3 = k for some k  Z .
(n3- n) = 3k for some k  Z , then we have to prove
p(n+1): [(n+1)3- (n+1)]/3 = k for some k  Z .
[(n+1)3- (n+1)] = 3m for some m  Z
Proof: LHS = [(n+1)3- (n+1)]
• = [ ( n3 + 3n2 + 3n + 1) – (n+1)]
• = ( n3 - n) + 3n2 + 3n
• = _from p(n)_ + 3n2 + 3n
• = 3k + 3(n2 +n)
• = 3( k + n2 +n)
• = 3m , where m = ( k + n2 +n ) - proved.

Chapter 4 11
Example 4.7
Show that all numbers of the form 7 n – 2n are divisible by 5 for all n  N.

Ans:
Basic Step:
Take n=1, LHS= 71 – 21 =5=5x1: 5 is divisible by 5
Take n=2, LHS =72 – 22=45=5x9; 45 is divisible by 5.
Take n=3, LHS =73 – 23 =343-8=335 =5x67, 335 divisible by 3.
Inductive Step:
p(n)  p(n+1) is true for all n  N.

p(n): (7n – 2n )/5 = k for some k  Z .

.ie 7n – 2n = 5k for some k  Z , then we have to prove
p(n+1): (7n+1 – 2n+1 )/5 = m for some m  Z .
.ie 7n+1 – 2n+1 = 5m for some k  Z.
Proof:
LHS = 7n+1 – 2n+1
= 7. 7n – 2.2n
= 7. 7n – 7.2n + 7.2n - 2.2n
dummy factor
= 7 . (7 – 2n ) + 7.2n - 2.2n
n

= from p(n) + 5.2n

= 7. 5k + 5.2n
= 5 (7k + 2n ) = 5m , where m= 7k + 2n , proved.
Chapter 4 12