Page-
uantifiers
Typesi
AZ UnversalQuabtH£er
is_apredi.cate wi
I f PCX)
the indivioual variable X_as
rgumept then theaSSertion
which ?s
"fom a l X,_PCA
interpreted as "For all valuLes of
the aSSerHon PC)_ís true
aStodemest in ww'ch the vaniable
X is said to be univerSally uanHfi
We denbte he phrase for_al
by called he universal quantt
he meaninq of ¥_i s f r al or
Hor eme o r ffo
o r each".
If PCX) is true for evemy posS ble
value Of X, then x P(x) is tuL
CthesISe kP(X) isfale
Exampl e
Le P(X) be he
predi cate_Xz0
Ohere 1S
any posiHi int eger
Then,propo siion x P(x is
Howeverr,if
ifx is any real numbCr
then x P(X)
sFalke oropo si+0
propogiHoD
Existent+ial auantifie
Suppose for the predicate Pc
PX) is
falue but there eyi'sts atleast
me Value of xfor which fex) is
true,hen we Say that in this
propoSiion x is bbund by existentra
,uanifiCaion We denete the words
there exists by the symbel 2
Then he notation x Plx) means
"here exisHs a Value ef X fox Luwch
PCX is true
Example
Consider the universe as the set bt all
integerS
Let P(XY)_olehote the preditede x+Y=1D
a) Then Symbolic Statement x 3 PCX,Y)
is inter prefed as for every intege
Xthere exist an 1mtege y Such
4hat X+y = 1D e y 0-x)
b)NDO, Considea the staement yx
This statement is read asthere exfsts
On inteqen y so thod itor all imtegers X
Xty= I0 Tus SHat ement is false
)The st adement 3 pex,4) is ead as
there exist inteqers X and y such
thad X+ Y 16" 1his is a Arue iateLment.
Dat
Page
EXcumples oy Quani fi ers
rHe tng lish Sentense fo each o
the ollowi9
1) P ) A (x)
(PexD)A TCX)
Let fellauin be dhe predit ates
Pca x is n the class
(x) X(an_Speak 0 a
R (X) x is borm_in Tndia
SCX) x has heen iN NCC
TLX) : X is homest
)Somepne in youmClaSS Can Speak
Ora
)EveTyone in youm ClaSS ishomest
These s a persoD im the
Who was not borm
Class
in India
KVD A_student im your class has
been in NCC
2For the universe ofall inteqeS-
et PCx) X),RC x),
T(X) be he s(x)_and
tlouain Statener
CA 1S even
RCXO X 's etect Square
s CX x is_divisible hy 4-
TC) xis dlivisibleby 5.
2 t e folloOin q Statem.enti in symbolic
forco:
1 Atleast one inteaes is even
Theme exists a positie intege that
is even
T f x iseNen then x is not ivisible
by 5
x (X) wT(X)
iv) There exists an eNen inteq
divisihle by S
C(K)ATCO
aperfec Squgre.
T Xx is een and x is
hen X is divisihle. by
x[gLxD A Rlx)> SCx)
*NOTma fgrYMS
ioble2 nd
A_product of the vaT
fheirncgations in a forM 1a
Colled as un elenentar Prbdt
e P gR
similary a sum Of the var1ob
a n d heir_negaHons is clles 03 an
elernenday Sum
PV7R VgVIR
A necessay ond Sufficient condiHon
fo on elermertary oroduct to be
dendically false is thatt(on tain
atleast one pai GP facto7s in Wht
one 1S neaotton of he oherr
fng 7AA7 Ab =
o
A neceSsar y and Sufticient ondiho
for an
eemeniaru 9u m tu be
Idenically
D
tTue is hat tCtnt+ur
leat one
pair of fattorsim
which one s the
fhe othe negahom ofot
VPv@R.. .. -|
Lt -
Disjun cti ve NoTmal Form DNF
An_ expresS1om ot_n_Variables
XXa Xn S Saud to_be a
mint er m _ f t_is of
he
AX2 A X X
A n exre sslon s sa'd to be
Disiunctie NOnmal form' Ie
its
a join Of
mintermS
X A X 2 X) V XA K2 AYa
e
consist 0f a
A statement whch
disiunCHonof fundamen ia Conjuncthon=
digunaH ve norma Form-
îs_calued
Examples
) oP ) V ( P )V
(iu ) CPnN) V PAT)
Solved_examples on DNE
DNF of the foTm
0btaned
(TPV19)F CP1)
(7PV74) (PE7)
ImplicoaHon
V (PE>7) Lad
77PV7)
Date
Page
EGPv79) v[Pm V (7PAI(7))
(1eA179) v en74) v (Pa9)
PA) y (PA7q) v(7PA )
obtun DNF of the follouwing Fomm
p 4) A Coopa9)
P v)ACwPAL)
WP A PA) v(2 A Vp )
E
PA ) v(VANP)
P DNF Pniple DNF
A funda menta_coniundHon
has a as nminterm that
TP there are 2
2 4 minte mg. Statements then-
Tf 3 statements, Hhen 2- 88 ifem-
n
Every_Statement_
Tand
Tepresente
Teprese
sented as
Its ne aaHom
O, Thus 1s epreset
numbem resuling to to a binary
binay
The
minterm iSrepre sented as_M
Ldherek is decimal la as
aatbinaTy number ulval
Rauvaler
ent
of-
Minterm Binary Decima Manterm
Representahen_ equvalent YepYestntahon
PAL Mo
M
P 2 M2
3 M3
EXamples
1 Find PpNE of ol louoin
P ) V
P v
E PV ) v
ev v
P V Inctacte
A( V7) V[, APVMe)D
Pand ,
P
= (1 n ) v( 7PAT) v (Pai)
M,V Mo VMa
20,13
Convert py AT) v_ (p A1) to
PDNE.
Page
Given,
p v Ar) y p ,
Here,
P9 n, PA arefundamental
Comjunltions
Inctude, (q,r) p and
i n in them
to Conve to ointemS
p qv include
=p 9A rv1r)]Y
L(pa)A lTv1*)J.
incude r
(Pn9,n) V P nT) \
Lu tt+t
M V M V Ms V
M4
24,5 b,1
NoO,
4Ar (T) A (pvP)..ncude -
=(1 rA P)v( , arn1P)
-(p Aq,AT) V (1p rang
M, V M
(o)
3,7
No Conside
p 9 (pAq)n TV1T). include
(panqAT) Vpa11 A77)
M5 VMy
4,5
PDNF for P V nr) v(PV74 is_
enby 3,4,5, 6,1
(i1) too) (101) (1 (11)
= pa9AT) V(PA19 Anr)v (PO11 )V(PaA1
NoTma Fom CCNE)
Cenuncte
vamiableg
An expression of n
XX2 X n is Said to be a
maxterm if i t is af h e f r m
X V X2 VX3 V. .. VXn
be n
An expresstom sSaud to
f r m if it is
ConjunCtive n o ma
a meet of maxte m SS
X VX2 VX2 AX, V X VXa)
vP n (Pvi)
Erample :_ i)
CPvvr)a (ap)
Date
Page
Solved lxamples on CNE
Obtained cNE of the fo llowinq
Py)> P>7)
PV1) (P> 11)
P V71) V ( P71)
(1Pv71) v [CP>7q) A14P))
(11P A114) V_[aPv79) A(T19 VP)L
PVTPV1,) A(PVPv4) A
(v7Pv74) ^( 2VPv)
90btoin theCNF Of he for m
PA)v [awP qn).
P ) V (wPn ar)
P v(oP AAT))A(,
Vv(wP a AD)
(PvPn (Pv)a Ce nr)) A
v
PCNF Priniple cNF
A Funda mental disiunttibm Ahat
haall stattments O hei meqaHans,
unde ConsideraHom is_knoLo
mAxtem)
Te 2 statemenàs hen 2 : 2 4 maxtem.
P v py PV4
TA Sate ments, then 2-3 maMterms
-Evey
EVemy Statement isrpresented as O
nd i negaHOm is repreieded as
husreprelEMInato bi ndmy_numbes
Maxterms repr estnted as M MA here
K1SHae decimal eaValent 04
hat bimamy numbe
Maxterm Bingry Decimal_ maxte)
Representation eauvalet reprejentato
M3
pV
P V Mo
Date
Page
EXamples
1 PV ) P Find PcNE
PV) 7P
1 ( P V ) v7P
E7P1 ) vP
E (P v7P) n (aPV7)D
PACnPV7)D
7 y (1)1AL
1Pv1J-
htud
Pv) n(apva) (7PV1
M 2n M
T 2,3
Convert pv (qnT) y (P /A) to
PCNF
venD
pvqAT) V(PA)
Py) A(PVo)) v (PA
E Pv9, VP) APvvq) Distrtbuhve lau
A CPv*vP)
CPVTV)
Dr'stributve.
La
Py 4)A (Pv ) PvT PV qv)
pv,) A
(PVT) A (Pv4VT)
Here Pyg Pyr are undamenta
disjunChon
PvVY_is maxter m
Incuale T_and in them
Comvet intn max} ero
PV PvV (rA) inude
(pvv) a(pvqvi)
loot}
M A M
=TT
Now Considec
PY=pya) V9 vq)include 4
PvVT)A (Pv12 VT)aTYago in
Orde
(oce) (o1o)
M A M2
TT O,2
PCNF for gi ven term is T
To,1,2 (Pvwr)aC PVV1)A (PVniv
Date.
Page-
*Madhemat Ca Tnduction
STepsa
1Basisaf in.duetiom
tais Step the given equato
is proved by Substi tuHn ae
bag's Value nwmber j e , the
minimum Valuo for the Variable h._
h's mimum yaluL will be 4wen
n a e pOblem_ Statenment
o Taduchon Step
n Hhs step, the given esuatom
asSLIme dto be true c
Valua 0f n
3 ducuon hypstheis Stp
In his Step thegien
esaHo
is poed H ne K .
To do So ue_ge he assunmphm
in Stp 2
Hencethe gien esatiom1S
true for
TA it îs tu for neK
1S tue fo hen t
Thus s per the mductlon
he oiven eauaHonfs tue
hypoth es S
to
'1 I t is t r u for no ,ne+1, no*2,*:
EXamplcs
Prove that
+2+ 3+
2
ina mathemahice mducion
Let E be the esuaHoY_
I 2 t3 + ntD
2
Siep 1 asis of Step_
SHep Tnduchon Step
ASsum e that E is trw fa n= K.
+2t3t +K = KCKt)
2
Shep ndu chon hy pothesis
Psve +hat E is Lrue fox na Kt1
e
I+2 t 3
2
Date
Page
Psoof
LHS= +2 +3 + + k+1
t 2 +3 + +k+ Kt)
k (K+ K t F o m sepz
2
KCKt)+2(K+1)
2
(K+1) k+9
2
(K+) ( K+1+1)
2
R:H S
E 1s trug for n : k+)
Thus 0 pe inducH0 hy pothesis
i s tru or all_my
+2+ 3 + '+n =
nn +)
2
eShOuw that14 2 +
2+3 t - +n)
2
n
Let
PCn) 1+2 n3 - (1+ 2++)
Page
8asis Step
2
' PC1)s to
i)InducHon step
ASsume that PCK is true
+ K (1+ 2++ tK)
tale Knou
+2 3+ +k = KCKtI)
SubsHitutinq ( I )in (I)
2
+2+ +k=K+1
1
In du cHom hypothea's
poe hat PUKt) fs true
ie + 2+ + k+1) =|(k+1) Ckt11)
2
EE
3
Date-
Page-
K+1
(K+1) CkH+)
Probf
K+1) K +1)
12 2 3 K(K+1)(k)(k1a
fom tep 2
K+1 (ktD CK+)+1)
(kt))CK+2)
Kt 2) +1
( 1 Kt2)
+2k +)
(x+1) C K+2)
(k41)
(K K+2)
t
K+2
Kt
R+1+
E 1S t u e for n= kt1. Hence Proved
Pa
Snouo thot n(n-) is divisible by
24 Ohere n is any oddpositive
inteat uimg M I
Let P (): n (n-) is divisible by 24-
Bauis Step
For me
PU I-1)=0 which is
_divisible by 24
'PCI) s true
11Tn.duction Step
Assume PCK) 3 tmue
PCk)_kk) is_divisible hy 24
where kis_odd inteqe
K K (K-1): 24 a where a 1
NOu the next 6dd intea.e is (Rt2);
InducHon hypotheais
Conside Pkt2) and moue t is
true
Proof
PKt2) (Kt2C(kt 2-1)
(K 2) K[k+3)
(Kt2) K+3)(K+1)
(Kt2) C 412 (K+3)
+ 2(K+I)Ck+3)
kCKt) (K13)
pistibuH ve L
K(1) (k-1+4) + 2 (kt)(K+2
KCKt1DCK-1)+ 4k k+) + 2(K+1)Ck:
KCk-1)+ o (Kt1) [2k+k+3]
K K-1) 2 (K+1) ( 3x+3)
( )+L(k+)
24a G (K+)2 24a
we knbw thaut k is a h bdd number.
k is an eeb udbe
Le
R+I = 2X
24 q +C(2x = 24 + f4x
24a +x2)
PCK+2) is divisible by 24
Pn is allo tru
Prove ihat - 3 s a mutiple of
6 by MI nzl
Le Pn)be -3" is mutiple
5
asis Step
Con side n=1
-3 - 6 i )utdiple. De 5.
PC S true
)Tncuchian step
AsSume the PCK) is true
- i s multiple of 5
g 3 5a Ohee aerand
5
)Induction hypothesis
Conide K+
3K+
2(g) -3()
2(5a+3) -_3 (3k)
40+ x(3 ) - 3(3)_L
40 8-3
4a 3 C5)
5 (2o t )
i s muliple of 5
PK1is1ue
TOTD he psintiple of M
P i s true (oY hz)
3 Youtliple of
