TECH PARTNER

LMS PARTNER

PRINCIPLES OF MATHEMATICAL
INDUCTION
LIVE NOTES
–creating while teaching
Full detailed step by step solution
© Prof Iyer
Prof Iyer APSL(IIM-L)
Founder Director - IB WITH IYER
Second Teacher FZE
Ex faculty London School of Economics India Campus
Author - Examiner – Moderator
Workshop Facilitator - AA and AI HL
Author Nov 2021 AA HL Exam Solutions-
Author - AP 2020 Calc AB and AP 2021 Calc 2021 BC
Speaker NACAC US Speaker and Delegate (US) since 2012

Distinguished Teacher Award 2022 for Mathematics

The IG Group UG Haftungsbeschränkt
Germany

Dear Educators and learners: Any discrepancy in the question, feedback or comments, do not hesitate to write to me. I will
appreciate your suggestion on and improve to serve the community better

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

1. [ Maximum Marks 7] Paper 1 Unit 1: AHL portion
𝒏(𝒏+𝟏) (𝑛)(𝑛+1)
1+ 2 + 3 +……… n = 𝟐
( Also can be written as ∑𝑛𝑖=1 𝑖 = ( 2
)

Prove the above conjecture by Principles of Mathematical Induction

Proof
Let 1+ 2 + 3 +……… n = P(n)
For n =1 or P (1)
1.2
LHS = 1 RHS = 2
= 1 M1

So LHS = RHS
For n =2 or P (2)
2.3
LHS = 1 +2 =3 RHS 2
=3

So LHS = RHS
For n =3 or P (3)
3.4
LHS = 1 +2 +3 =6 RHS = =6 M1
2

So LHS = RHS
Therefore it must be true for n = k where k is positive integer
𝒌(𝒌+𝟏)
1+ 2 + 3 +……… k = P(k) = 𝟐
……………………………… (1) M1

To prove for n =k +1 or for P (k+1)

Consider LHS
For n=k+1, 1+ 2 + 3 + 4+…….k+k+1
(𝒌+𝟏)(𝒌+𝟐)
To prove : 1+ 2 + 3 + 4+…….k+k+1 = 𝟐
M1
Proof
Consider P (k+1) , LHS
𝑘(𝑘+1) 𝑘
1+ 2 + 3 + 4+…….k+k+1 = 2
+ (k+1) = (𝑘 + 1)[2 + 1] ( from eqn (1))
𝑘+2
(𝑘 + 1)[ ] A1
2
Proved

As it is true for n = k+1 for n= k being true This must be true for any value of n A1

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

2. [ Maximum Marks 8] Paper 1 Unit 1: AHL portion
𝒏(𝒏+𝟏) 𝟐 (𝑛)(𝑛+1) 2
13+ 23 + 33 +……… n3 = ( 𝟐
) ( Also can be written as ∑𝑛𝑖=1 𝑖 3 = ( 2
) )

Prove the above conjecture by Principles of Mathematical Induction

Let 13+ 23 + 33 +……… n3 = P(n)
For n =1 or P (1)
1(2) 2
LHS = 13=1 RHS = ( ) =1 M1
2
So LHS = RHS

For n =2 or P (2)
2(3) 2
LHS = 13+23=9 RHS = ( ) =9
2
So LHS = RHS

For n =3 or P (3)
3(4) 2
LHS = 13+23+33=36 RHS = ( 2
) = 36 M1
So LHS = RHS
Therefore, it must be true for n = k where k is positive integer
𝑘(𝑘+1) 2
13+ 23 + 33 +……… k3 = ( 2
) ………………………(1) M1

To prove for n =k +1 or for P (k+1)

Consider LHS
For n=k+1, 13+ 23 + 33 +……… k3+(k+1)3
(𝑘+1)(𝑘+2) 2
To prove: 13+ 23 + 33 +……… k3+(k+1)3 == ( 2
) M1

Consider P (k+1) , LHS

𝑘(𝑘+1) 2
13+ 23 + 33 +……… k3+(k+1)3 = ( 2
) + (k+1)3 Using (1) M1
𝑘2 [(𝑘 2 +4(𝑘+1))
= (𝑘 + 1)2 ( 4 + (𝑘 + 1))= (k+1)2 4
]

(𝑘+1)2
=> [𝑘 2 + 4(𝑘 + 1)]
4

(𝑘+1)2
=> 4
[𝑘 2 + 4𝑘 + 4] M1

(𝑘+1)2
=> 22
(𝑘 + 2)2

(𝑘+1)(𝑘+2) 2
=> ( 2
) A1
Proved. As it is true for n = k+1 for n= k being true. This must be true for any value of n A1

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

3. [ Maximum Marks 6] Paper 1 Unit 1: AHL portion
Prove that the sum of first even n integers is n2+n. Prove by Mathematical Induction
or it can be asked as (Also can be written as ∑𝑛𝑖=1 2𝑖 = 𝑛2 + 𝑛 )

To Prove: 2 + 4 + 6 + ……. 2n = n2+n

For n=1
LHS =2 RHS =12+1 = 2 M1

For n=2
LHS =6 RHS =22+2 = 6
It must be true for n = k i.e., 2 + 4 + 6 + ……. 2k = k2+k……………. (1) M1

We have to prove for n = k+1

To prove: 2 + 4 + 6 + …….+2k + 2(k+1) = (k+1)2+(k+1) M1
LHS
2 + 4 + 6 + ……. 2(k+1)
 2 + 4 + 6 + ……. +2k +2(k+1)
 k2+k + 2(k+1) Using (1) M1
 k2+k+2k+2
 k2+3k+2
 k2+2k+1 +k+1
 (k+1)2+(k+1) A1
 Proved. Must be true for all values of n A1

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

4. [ Maximum Marks 9] Paper 1 Unit 1: AHL portion

𝟏 𝟏 𝟏 𝟏 𝒏(𝒏 + 𝟑)
+ + + ⋯………. =
𝟏. 𝟐. 𝟑 𝟐. 𝟑. 𝟒 𝟑. 𝟒. 𝟓 𝒏. (𝒏 + 𝟏). (𝒏 + 𝟐) 𝟒(𝒏 + 𝟏)(𝒏 + 𝟐)
Prove the above conjecture by Mathematical induction

Proof

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005
5. [ Maximum Marks 6] Paper 1 Unit 1: AHL portion
3
Using induction, prove that n -7n+3 is divisible by 3 for all n positive integers

Proof
For n =1, 1-7+3 =-3 divisible by 3
For n =2, 8-14+3 =-3 divisible by 3
For n =3, 27-21+3 =9 divisible by 3 M1
It must be true for n = k
k3-7k+3 is divisible by 3 as the result is -3. Let it be 3m
form a positive integer i.e., k3-7k+3= 3m (1) M1
To prove for n = k +1
(k+1)3-7(k+1) +3 M1
=k3+3k2+3k+1-7k-7+3
=(k3-7k+3) +(3k2+3k-6)
=(3m) +3(k2+k-2) Using (1) A1
as 3 (m +k2+k-2) divisible by 3
Proved.
Therefore, it must be true for all values of n A1

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

6. [ Maximum Marks 9] Paper 1 Unit 1: AHL portion
Prove by Mathematical Induction (2n)! ≥ 2n(n!)2
Proof
For n =1
LHS RHS
( 2n)! 21(1!)2
Put n=1 2(1)
2! =2 =2
LHS = RHS M1

For n =2
LHS RHS
( 2n)! 22(2!)2
Put n=2 4(4)
4! =24 =16
24 > 16
LHS > RHS M1
For n =k it must be true
LHS RHS
( 2k)! 2k(k!)2
Let us assume it is true for n = k so, (2k)!≥ 2k(k!)2 ……(1) M1

To prove for n = (k+1)

Ie to prove (2(k+1))! ≥ 2k+1((k+1)!)2
Proof
Consider (2(k+1))!
(2k+2)!
(2k+2) (2k+1) (2k)!
2(k+1) (2k+1) (2k)! M1
Consider equation (1) and multiply both sides 2(k+1) (2k+1)
 (2k)! 2(k+1) (2k+1) ≥ 2(k+1) (2k+1) 2k(k!)2 M1
 (2k)! 2(k+1) (2k+1) ≥ (k+1) (2k+1) 2k+1(k!)2

But (k+1)!)2 = ((k+1) (k!))2 M1

 (k+1)2(k!)2
 (k+1) (k+1) (k!)2 < (k+1) (2k+1) (k!)2
 LHS = > (2k)! 2(k+1) (2k+1) ≥ (k+1) (2k+1) 2k+1(k!)2 M1
>(k+1) (k+1) 2k+1(k!)2
=(k+1)22k+1(k!)2
=((k+1) k!)22k+1 A1
 >((k+1)!)22k+1 A1
proved (2(k+1))! ≥ 2k+1((k+1)!)2

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

Maximum Marks 10 Paper 1 Unit 1: AHL portion

Prove De Moivre’s theorem (cos A + i sinA) n= cos nA+i sin nA using Principles of Mathematical
Induction
Case 1 Exponent is positive

For n =1
LHS RHS
(cos A + i sinA)1=cos A+i sin A CosA + i Sin A M1
For n =2
LHS RHS
(cos A + i sinA)2=cos2 A – sin2 A+2isin A cos A = Cos 2A+isin2A Cos 2A+iSin2A

It must be true for n = k

(cos A + isinA) k= cos kA+i sin kA……………. (1) M1
To prove for n = (k+1)
Ie to prove
(cos A + isinA) k+1= cos (k+1) A+i sin (k+1)A M1

Proof
LHS
(cos A + isinA) k+1= (cos A + isinA) k(cos A + isinA) 1
From (1)
= (cos kA + isinkA) (cos A + isinA) Using (1) M1
=coskAcosA +icoskAsinA +isinkAcosA+i2 sinkASinA
=(coskAcosA -sinkASinA)+i(coskAsinA +sinkAcosA)
Cos A Cos B – SinA Sin B = Cos ( A+B)….(2)
Sin A Cos B + Cos A Sin B = Sin ( A+ B)….(3)
= Cos (kA+A) +iSin(kA+A) ( Using (2) and (3) respectively) M1
= Cos A(k+1) +iSinA (k+1)
= RHS

Proved for n =(k+1)

This must be true for all positive values of n
Proved A1

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

Case 2 Exponent is Negative

(cos A + i sinA) -n will have negative integer as exponent

Or (cos A + i sinA) -n for n > 0
1
(𝑐𝑜𝑠𝐴+𝑖𝑠𝑖𝑛𝐴)𝑛
will have positive integer exponent M1

From Case 1, proof we know that

1 1
(𝑐𝑜𝑠𝐴+𝑖𝑠𝑖𝑛𝐴)𝑛
= 𝑐𝑜𝑠𝑛𝐴+𝑖𝑠𝑖𝑛𝑛𝐴 M1

1 𝑐𝑜𝑠𝑛𝐴−𝑖𝑠𝑖𝑛𝑛𝐴
=𝑐𝑜𝑠𝑛𝐴+𝑖𝑠𝑖𝑛𝑛𝐴 . 𝑐𝑜𝑠𝑛𝐴−𝑖𝑠𝑖𝑛𝑛𝐴 (𝑐𝑜𝑛𝑗𝑢𝑔𝑎𝑡𝑒)
𝐶𝑜𝑠𝑛𝐴−𝑖𝑠𝑖𝑛𝑛𝐴
=cos2 𝑛𝐴+𝑠𝑖𝑛2 𝑛𝐴 Theory: cos (-𝜽) = 𝒄𝒐𝒔𝜽 𝒂𝒏𝒅 𝐬𝐢𝐧(−𝜽) = −𝒔𝒊𝒏𝜽

= cos(-nA) +isin(-nA) Using theory A1

Proved for case 2

Must be true for all values of n A1

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

7. [ Maximum Marks 8] Paper 1 Unit 1: AHL portion

Prove that 9n-2n is divisible by 7 for all n being Natural numbers [8]

Proof

For n =1
LHS RHS
( 9-2) 7 is divisible by 7
7
LHS = RHS M1

For n =2
LHS RHS
( 92-22) 77 is divisible by 7
77 24 > 16
LHS = RHS M1

For n =k it must be true

LHS RHS
9k-2k is divisible by 7 7m Where m is some positive integer M1
9k-2k =7m….(1)

To prove for n = (k+1)

9k+1-2k+1 is divisible by 7
Taking LHS we get
9k+1-2k+1
= 9k.9-2k.2 =
= 9k.(7+2)-2k.2 M1
= 9k.7+9k 2-2k.2
= 9k.2-2k.2 +7.9k M1
=2(9k-2k)+7.9k
=2(7m)+7.9k….From (1) M1
= 7 [ 2m+.9k]
= 7 [ A positive integer ]
= Divisible by 7 A1
Proved for n = k+1
Hence it is proved for all values of n A1

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

8. [ Maximum Marks 12] Paper 1 Unit 1: AHL portion

If S n = ∑𝑛𝑘=1 𝑘(𝑘 + 1)
a. Find the ntth term [1]
b. Find Tn-Tn-1 [2]
𝑛(𝑛+1)(𝑛+2)
c. Prove that Sn= 3
𝑢𝑠𝑖𝑛𝑔 𝑠𝑒𝑞𝑢𝑒𝑛𝑐𝑒𝑠 𝑚𝑒𝑡ℎ𝑜𝑑 [4]
𝑛(𝑛+1)(𝑛+2)
d. Prove that S n= 3
𝑢𝑠𝑖𝑛𝑔 𝑚𝑒𝑡ℎ𝑜𝑑 𝑜𝑓 𝑖𝑛𝑑𝑢𝑐𝑡𝑖𝑜𝑛 [5]

Solution
a. The nth term is given by Tn = n(n+1) =n2+n ….(1) A1

b. Tn-Tn-1 = n2+n – (n-1)2-(n-1)

 n2+n – n2-1+2n-n+1 M1
 2n A1

c. ∑𝑛𝑘=1 𝑘(𝑘 + 1)
= 12 + 1 + 22 + 2 + 32 + 3 + ⋯ … . . 𝑛 2 + 𝑛 M1
 (12+22+32+……n2) +(1+2+3+……. n)
 Sum of square of first n natural numbers + Sum of first n natural numbers
𝑛(𝑛+1)(2𝑛+1) 𝑛(𝑛+1)
 6
+ 2 M1
𝑛(𝑛+1) 2𝑛+1
 2
[ 3 + 1]
𝑛(𝑛+1) 2𝑛+4
 2
[ 3 ]
𝑛(𝑛+1)(𝑛+2)
 A1
3
 RHS = Proved

d. Prove by method of induction

Put n=1
1(2)(3)
LHS S 1= (1)(2) = 2 RHS = =2
3
LHS = RHS
Put n=2
2(3)(4)
LHS S 2= (1)(2) + 2(3) = 8 RHS = 3
=8
LHS = RHS M1
𝑘(𝑘+1)(𝑘+2)
Let it be true for n =k implies S k= 3
…... (2) M1
(𝑘+1)(𝑘+2)(𝑘+3)
To prove for n = (k+1) ie to prove S k+1=
3
Proof
𝑘(𝑘+1)(𝑘+2)
LHS= Sk+1 =Sk+Tk+1 = + (𝑘 + 1)2 + 𝑘 + 1 from (1) and (2) M1
3
𝑘+1 𝑘+1
(𝑘(𝑘 + 2) + 3(𝑘 + 1) + 3) = [ 𝑘 2 + 5𝑘 + 6] M1
3 3
(𝑘+1)(𝑘+2)(𝑘+3)
 = 𝑅𝐻𝑆 = 𝑝𝑟𝑜𝑣𝑒𝑑 A1
3

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

9. [ Maximum Marks 10] Paper 1 Unit 1: AHL portion

Consider a sequence of real numbers defined by u1 =1 and un+1 = √1 + 2𝑢𝑛 for n ≥ 1 for n being
integers
a. Find u2,u3 and u4 [4]
b. Prove by Mathematical induction that un < 4 for n ≥ 1 [6]

Solution
For n=1

We get u1+1 = √1 + 2𝑢1

So u2 = √1 + 2(1)

u2 = √3 A1

For n=2

We get u2+1 = √1 + 2𝑢2

So u3 = √1 + 2√3

u3 = √1 + 2√3 A1

For n=3

We get u3+1 = √1 + 2𝑢3 M1

So u4 = √1 + 2 (√1 + 2√3) A1

b. From (a) for

n =1 u1=1 < 4
n =2 u2=√3 < 4
n =3 u3=√1 + 2√3 < 4
…
…
It must be true for n=k
n =k u k< 4 ………..(1)
M2

Therefore it must be true for uk < 4 ie uk+1 = √1 + 2𝑢𝑘 must be true (1) M1
To prove for n = k+1 ie to prove uk+1 < 4 M1
Using (1) we can assume let uk =3.9999
Substituting in (1) we get uk+1 = √1 + 2(3.999) = uk+1 = √8.99999 < 4 M1
Therefore we can prove that uk+1 < 4 A1

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

10. [ Maximum Marks 11] Paper 1 Unit 1: AHL portion

Let u0 =1 and u1= cos𝜽 where 𝜃 𝑖𝑠 𝑠𝑜𝑚𝑒 𝑓𝑖𝑥𝑒𝑑 𝑐𝑜𝑛𝑠𝑡𝑎𝑛𝑡

And given un+1= 2u1un-un-1 for n ≥1 and n is an integer
Using induction prove that Un = cos(n𝜽) for n ≥ 0 [11]

Solution
Put n = 0, we get, u0 = cos (0𝜽) = 𝟏 We prove from given ( given u0 =1) M1
Put n = 1 , we get , u1 = cos(1𝜽) = 𝒄𝒐𝒔𝜽 We prove from given ( u1= cos𝜽) M1

Put n =2 ,we get u 2 = 2u1u1-u0 = 2 cos𝜽 cos𝜽 − 𝟏

= 2cos2𝜽 − 𝟏 = cos 2𝜽 ( from identity formula )
proved M2

Put n =3 ,we get u 3 = 2u1u2-u1 = 2 cos𝜽 cos2𝜽 − 𝐜𝐨𝐬𝜽

=> 2 cos𝜽( cos2𝜽 − 𝟏 )
=> 2 cos𝜽( 2cos2 𝜽 − 𝟏 − 𝟏 )
=> 2 cos𝜽( 2cos2 𝜽 − 𝟐 )
=> ( 4cos3 𝜽 − 𝟒 𝐜𝐨𝐬𝛉 ) =cos3θ
U3 = Cos3θ

= 2cos2𝜽 − 𝟏 = cos 2𝜽 ( from identity formula )

proved M2

From above we can assume that it is true for n = k

uk = cos(k𝜽) M1

To prove for n = k+1

uk+1 = cos((k+1)𝜃) M1
[ cos A cos B +sinA sin B = cos (A-B)] (1)
[ cos A cos B -sinA sin B = cos (A+B)] (2)
LHS = u k+1 =2u1uK-uk-1= M1
=> 2 (cos𝜃) (cosk𝜃)- 𝑐𝑜𝑠(𝑘 − 1)𝜃
=> 2 (cos𝜃) (cosk𝜃)- 𝑐𝑜𝑠(𝑘𝜃 − 𝜃) M1
=> 2 (cos𝜃) (cosk𝜃)- 𝑐𝑜𝑠𝑘𝜃𝑐𝑜𝑠𝜃 − 𝑠𝑖𝑛𝑘𝜃𝑠𝑖𝑛𝜃 ( using (1)) M1
=> (cos𝜃) (cosk𝜃)−𝑠𝑖𝑛𝑘𝜃𝑠𝑖𝑛𝜃 M1
=> cos ( k+1) 𝜃 Using (2) A1
=> Proved for n = k+1

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005

PROF IYER ib.mathfaculty@gmail.com Teaching IB, AP and Freshmen since 2005