UNTT

PROPERTIES
OFOF INTEGERS
IN MATHEMATICAL TNDUC

A by the S
Special' properby erhibtted
posttive totegers wlll enalole us to estals
Cerain mathem
ematcal HOvmulas and heorems by usic

techntaue Called mathemattcal inductton. This

ethe

Tesuts.
pTOO play a Key ole in many he

THE
NELL-ORDERING PRINCIPLE:

For any two listinct inegers x,y,

we know that uwe must have e ther
t< < Or

Hocoever, ths ds alSo Hrue if, * and y are ratia

umbers or. real numbers.

Suppase ue try Ho ezpress Hhe Sylose

Z o Z , usig the inequalty Symbols and 7

We trd that uwe can
detine the set a basitve
elemets Z as
2 = e z 1>of = zez|>1}
the Lnd
 an
Thus every non-embby suloset x o 2t cotalns
Coains
X
Ineger a such Hhat a4Z,NEx- that ts,
elerment.
a least (Qr smallest)
Rt as the sets
But +hEs is noASo 4or ether Qt or

least elements.
themselves do not c o t a i n
number
Tattonal
Smallest posttve
e,there is no
d s a
number.
real
OY Smallest þositive t h e stnce o2W249
Tattonal number,
pasittve numbe /2l
the S m a l U e r YaHonal
w e uoould hC VE
the
us t o
olserva+tons Leod
These
2ez.
ollougropertby ef the set

THE WEL-ORDERING PRINCIPLE :-

Z cotalns
Sulaset a
ENer
ENery omempy
n Q
by Sayinq
Smales elemert (Wle alten express this

thout 2t s veLl orded).

ThEs principle serves to distinguish ztHrom

a n d et.zt s the basts o4 a pYoatechnleue

Knoon as maBhemottca hauctlon tlh s tcchntgue uoill

OLHe helb ius to Prove general mathematlcal statem

invoing postHve lotegers when centaln instonre

Statemert Suggesta general puttero?

 an
suleset ol t cortains
Ihus eNery non-emb x
Cotuo

that ls, X
such Hhat a4L, a - N E x
-

ter a
elenent.
a least (07 smallest)
ihe sets
etther @t or Rt as
But thls is not s o 4or
elements.
cotaln least
themselves do not
number
rottonal
Smallest þosttve
Lie,there is no
L s Saa
number. Tj
OY S n a l l e s A
pasitive real
9.
number, then s i n c e OL/
Tationa
pasitie
smaler
Tattonal number / 2 .
have the
w e uwould
the
leod us t o
These olaserva+lons
roperty ef the set 2T Z
folloung

THE WELL-ORDERING PRINCIPLE-

cotalns a
sulaset O z
ENery nonempy
+his oy Sayiaq
element (nle aften enpress
Smallest

that 2t is uweLl OTderd).

Thiis brnctple serves to dEstingush zHrom

a n d Rt.zt s the basis oj aþroa techntgue

knocon as malhematical haluCtton lhis echntgue uDll

aHen h e u p ius to prove, a gerneral mathematcal stacteman

invoving poswe lotegers uonen centaln instances gHhak

Statemert SugEsta general pcuttern

 Suloset x o 2 Como ns
Thus' every non-embby that Cs, x co
ex-
a4z.ae
such that
er a
1 element.
smallest) s
Seetts
s
least ( Qr Hhe
Hhe

tQt o r Rt
as
a Rtf
e
ettlh
heer
r
S o 4or
ths is noA Least
elements
elemets.
Buct leasA
cotain n u m b e

themselves
do not Tatiomal

þosttve
Smallest
Cs a wa

Le,there is no
rea nu
u mmbbe
err.
T
real
oZY249.
pasitve stoce
Smallest
OY then
attonal
number,
number /2
Tattonal

pasitve Smaller

the
OOuld ha ve ot o
t
th e
uoe su s
Lead
o l a s e r v a H o n s

These
set zZ
f o l l o o n g r o p e r t y
ef the
THE WNEL-ORDERING PRINCIPLE:

contalns a

nonemp
Sulaset o zt
ENery
ENery this loy
oy Sayinq
Saying
ezpress
enpress this
elemert
(We aten
SmallesA

orclerd).
uvell
thact 2t s
SerVes to dstinguish zJror
TThis princtple
basis a proa technleue
s the o4
and et. t
Hechnt9ue u l t
malhemattca
tnauctton tIhis
Knroo as
mathemateal stoateame
to Prove eneal
OLten belb us
wnen Centoln instances t h e
nvoing osttWe lotegens
StatemetSuggesta general patterot
 m THE PRINCIPLE OF MATHEMATICAL NDUCTION,

Let SCn) denote an open mathematical

Sttemeot that invoves one or more occuTences of the
VArable n,cwhtch epesents a bositive irteger.
a TSa) is true; and
6) whenever sck) ls true
(or Some berttcular, but
TOitYOriu choosen, KeZt)Hhen s(K+1) iS FTue,
then 8(n) is true
Jor all ne z".
proo Let SCn) be an open Statenent Satising
Condtons(@) and .
Let = t e Ztst) s alse
To
To prove that F = d, So +o obtain a controdict

we asSSume that F#¢.

Then by the Well - O r d e r i n g brioctple, the set F

has a Least element m' (Say), or uphich

S(m)is Halse O
Since S1) iS ATue, tt follows that m+1

Thus m)1 and hence m-1¬ zt with m-1ÇF.

(Sioce m s he least elemeot in F).

sioce m-1¢F, ue have S(m -1) is +TUe
Ww NCIPLE (THE PRINCIPLE OF MATHEMATICAL NDUCTION
Let Scn) denote an ope mathematical
Tement thct invo hies one or
more occurenceS of TO
Variable n,whlch
eesents a positve irteg
a) TSa.) is
4rue; and
6) henever
SCk) s rue
(Hor Some peticular, buu
OTotrorichoosen, KeEt)hen sCk+1) iS tTUe )
then S(n) is
true or all nEZ.

proo Let sCn) be an

open Statenment SatiSJEn
Condttions @) and .
Let F=t¬ zSt) ts dalse j
To prove that F =c, So +o obBain a controdict
we asS ume +h at F +o.
The by the Well -

Oroer ing rinctple, +he set F

nas a Least element m'
(Soy), or which
S(m)is alse O
Since Su) iS 4Tue, it
ollows 4hat m1
Thus m1 anmd hence m-1 E t
t h m-1ÉF.
(sioce ms he least element in
F).
sioce m-14E F, uoe have
s(m-1) is +rue
 -that
, it Jollows
conditon
Theretome y cotraolicting
= s(m) is true,
(m-1)+1)

mEF ( eqnO). T

aSSumbttOD
the
arose Jrom
Cotaclictloo
This
This

F +
F= 21.
all nE
ds true Jor
Thus sn)
m a l h e n n t i c a l i
innd
cuuuccHho
on0

malhematical

al
emark :- The princépler
The
ve cteger.
el þasiti
emark

Hhe s e i
o
Can be applied

EXAMPLES:

Hhat
n E t , þrove
OFor all
D\7+), usin
I1+2+3+4+ - -- +n =
= 2

mathenmatical inducton.

= n(n+1)
YCcaf- Let S(n):
i =
1+2 +3+4+-- - +9 2

Bosic Step:-
have.
( leaStelement in 2t), ve
For n 1
SC1): ~ =1(+1)

1
S (a1: 1 =
 Cttve Step:-
ttve St

HSSume Hhot S(K) s -true.

ie
SCK)
1+2+3---+K= KE
To 2
rove that SCK+1) is Hrue.
ieto prove-lhat,
SCKA1D: I+2+3+
44-K +(K+1) (K+1)2 (K+2)
=

Adding (k41) Ho bolh sides o

equatio , u get
+2+ 2+
+K+(K+1)
-- - -

=
k(K+12 + (K+1)
K(K+1)+2(K+)
2
= (K+1) K+2)

Thus SCK+) is 4Tue.

Theo by the pTinciple a Marthematical Induction.
SCn) is tYue oY al ns 2t.
T n is a poSHive integer, prOVe that,
12 +23+3.4 + -- -

+n (n+1) = n(n+1) (7
3
USIn mathematical induction.

roo-Let,
n(n+1) (n+2)
12+2 3+ 3.4 +---4n(n+1)
=
S()
3

Basic step;-
FOr n = 1,

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

2 2

S C 1 ) Is true.
ASSume h a t
S(K) is true
InduCtive step

+ 23+3 4
+-- -
+ 1) K(lk+1) CKt2)
=

ie 2 3

SCK+1) t s
H7ue
that
To brove

ie, to o v e -lhot,
1.242.3+3.4---+
K (k+1) + (K+1)(K+2)
S(K+) :
= (K+I)(K+2) (KH+ 3)

to kboih sides al eqn we han

Acldling (K+) Ck+2)

K+DCE+2)= k(K41) (k+9)

.9423+ --- + K(R+I)AT
3
 ++DK+2)= K(KEDCK+2)+2(K+1)
CE+2
3
= (K+1) CIK+2) (k+3)
3
=
(K+1) CC+2) Cc+3)
Ihus
SCK+) is true.
Thenby the. principle of Mathematical Inductior
S(n) is true oY au
positive ioteger n.

Prove that Jor each n6Z',

1 n(n+1) (20+1), usin
6
mathematical induction.

proa Let scn): i = n(n+1) (20+1)D

6

Casic Step:
FoY n=1,

1(1+1) (2c1D+)

SC1) is Tue

Inductive step- AsS ume that Sc is

) +Tue,for Some
Cwe assue ihat,
 SC6)s =+4---+K2 ktk+1) (2kt) is +T
6

TO prove thct sCK+) is 1Tue.

ie,to rove that,

Z
t
=1'4+24-- 4K2+(K+1)- (K+1) (K+2) (2Et9
6

is a tTue Stotementt.
consid@r, 2

LHS 1)
=
- 4 - - - +*+
(K+1)
KCK+D(26 2 +(K+ (rom )
6

6 CK+1)
kCR+1) (2+1) +

= (+1) k (2K+1)+ 6(K+0 .

(K+ 2K+K+6 K +6.

- 02(ar+7 +6)
6

=
+ (k+9) (2K +3) RHS
6
Stotement
+1? is true
SCK
nducto
Then, oy principle of Mathamatical
the
nezt.
sCn is HTUeor al
 all
For all n21,
n21, Prove thet,
1+3+54--- (2n-1)= OC2-1)C20+1)
3.
Let stn): 1+24g- + (2n-1)"- n(20-
3
basic Step:= For
n=L
1 = 1 (2C1) 1) (2C1)-+1)
-

1L.
s 1 ) Es 4Tue
Inductive Stepi AsSuMe +hat sck) Es truee
e , AsSUme hat,
SCI): 1+345*+-- - + (2k-1)= k (2k-1) (2k+)
3
Satrue Statemeot or Some k21
To prove-thcet, SC+1) Es true

ie to prove thout, 2

1 5 - - + (2k-1)+(2K
-

+1)= (K+I) (2K+1) (2K+3)

3
Consoler,

+ C2K-1)+
(2K +1)
+3+5+-
-

LHS=

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

= (2Kt K(2k-1)+3 (2k -1)) 2 * 4 SK-3

3
(2 +6x -

3
 a
W
- ********
******
'
*
********************************* .**
S
S
.
 t v e steb
i-e sCK): Assume -thot SCK) is true2.

23
T
is #TUe
CR+1) Or Some
Toprove that sCk+1) iS tus
eto prove
Vethot
SCK+):L-+ t+
KCEt1) E+)CE+a)
Constoder,
-+ + --
Ct) C+OCe+2)

C+10+2)
Tom
C+2) +I
Co+1) (Cc+2)
2+
(K+1)Cc+2)
K+12
C+1 C*+2)
Kt

si+1D ts +rue
Then,by +he NCe ple o! mathematcal nduc
S t n ) s true Aor all n4.
 6)For al neE bTove by mathematical inclueto
,

1+3+5+. -

+(2n-1) n =

For all na1, provethat,

n(n+1)(2),
+ n (n+2) =
+3 5+- -
-

3+24 6

mathermartHcal nduCtOn
oy ust brinciple el
n(n+1) ( 2n+7
ntn+2)=
Let scn):1.3 +2.44-- -+ 6
IoO
Basc Step: Fo n=1,

3 1 (1+1) (2+9)
6

3 3
St) s rue. s true.
ASSume
-that s (K)
I n d u c t t v e
step;
(K+1)2KtE
ume hat, = k
ASS kCK+2)
e, 1:3+2:4+3:5+-
- -

+ 6

SC)
som kE z1
S true for
SC+I) ts t u e .
To oTove that,

hat, (+DCe+3)
e sto pTOve k(E+2)+
+2:4+--+
Se+1): 1 8 = (+) (K+2) (2K+9)
6

Consicler,

C k + ) CE+3)
CE+2) +
-

--t
13+24+
(**D(E+3) (tom)
(+1)C2E+
+
 2 k(2+) +6(1+3)
(2k r +66 +18)
=
+2 ( 2r+1F +18)
e+D (E+2)C2r+9)
6

sCK+D Es +Tue
Theo, oy the iocë ple o mathematical toducdo),
Stn) is tTue or auA nz 1
For a
n71, prove oy mathematica nduuctioo *hat
4

proe Let Stn)

2 i
-
=
P4++---+n= n+1
4
csic Ste p:- For n=1,
1 12(1+1)2
4
1

s S C 1 ) i s rue.

Lnductive sLejp, -

Assume that sCS) is true.

i e , ASSume that

s() 13+24 3---t+ k= k"(K+1)

4
S rue
 c
******** ****************************~**.~*
***** *******¥ ***********
 uctVe Step
Assume that sCK) is «lTue
iesCK) ++ k-1 sis tue
lo
prove that, sCK+ s 47uê
.e to prove+hat,
-

SC+D : t24 -- -+ 2 -1
Consider
-42 =-1 +2 2.2-
=+
SCK+1) S true
the riciple of mathematical ocucton,
Then by
Stn) is true or a
n1