DISCRETE

MATHEMATICS
SET THEORY AND LOGIC
Ms. Mary Cristine L. Dizon
Bigyan ng 50 pesos
yan!
Magbigay ng limang (5)
parte ng katawan na
nagsisimula sa letrang
“t!”
Magbigay ng LIMANG
(5) PRUTAS NA KULAY
PUTI ANG LAMAN!
Magbigay ng LIMANG (5) PRUTAS NA
KULAY PUTI ANG LAMAN!
REVI EW

What is the value of 35 mod 3?

35 mod 3 gives the value of the
remainder when 35 is divided by 3.
Therefore, 35 mod 3 equals 2.
1. What is 233 mod 3? Answer: 2
2. What is 117 mod 4? Answer:1
3. What is 348 mod 3? Answer: 0
 Equivalence
Relations and
Partitions
 Equivalence Relations
an equivalence relation on a
set is a relation that is
• Reflexive
• Symmetric
• Transitive
 MP LE 1
EXA
• Reflexive
𝑥 𝑥
• Symmetric
𝑖𝑓 𝑥 𝑦 , 𝑡h𝑒𝑛 𝑦 𝑥
• Transitive
𝑖𝑓 𝑥 𝑦𝑎𝑛𝑑 𝑦 𝑧, 𝑡h𝑒𝑛𝑥 𝑧
 10 mod 3
✅ Reflexive

MP LE 2 ✅ Symmetric
EXA ✅ Transitive

• Reflexive
𝑥
10 mod 3 ~ 10 mod 3 𝑥
• Symmetric 𝑖𝑓 𝑥 𝑦 , 𝑡h𝑒𝑛 𝑦 𝑥
10 mod 3 ~ 7 mod 3 , then 7 mod 3 ~ 10 mod 3
• Transitive 𝑖𝑓 𝑥 𝑦𝑎𝑛𝑑 𝑦 𝑧, 𝑡h𝑒𝑛𝑥 𝑧
10 mod 3 ~ 7 mod 3 and 7 mod 3 ~ 13 mod 3
then 10 mod 3 ~ 13 mod 3
 ✅ Reflexive
PL E 3 ✅ Symmetric
EXAM ✅ Transitive

Suppose 2 people are said to be birthday-

related if they have the same birthday.
That is, they are born on the same day of
the year. Show that the birthday-relation is
an equivalence relation.
 ✅ Reflexive
PL E 3
EXAM
✅ Symmetric
✅ Transitive

Solution
Suppose A, B, and C are any 3 people.
A has the same birthday as A (reflexivity).
If A has the same birthday as B, then B has the same birthday as A
(symmetry).
If A has the same birthday as B, and B has the same birthday as C, then
A has the same birthday as C (transitivity).
Therefore, birthday-relation is an equivalence relation.
 ✅ Reflexive
PL E 4 ✅ Symmetric
EXAM ✅ Transitive

Let
Suppose that if
Prove that is not an equivalence relation.
 ✅ Reflexive
PL E 4 ✅ Symmetric
EXAM ✅ Transitive

Solution.
Reflexive?

Let
 ✅ Reflexive
PL E 4 ✅ Symmetric
EXAM ✅ Transitive

Symmetric?

Let

|- |
 ✅ Reflexive
PL E 4 ✅ Symmetric
EXAM ✅ Transitive

Transitive? ❌
Let

| | |
 PL E 4
EXAM
Let
Suppose that if
Prove that is not an equivalence relation.
Let
Then
but
So, the relation is not transitive and hence is
not an equivalence relation.
What is Partition?
Partition of a set, say S, is a
collection of n disjoint subsets, say
P1, P2, ... Pn that satisfies the
following three conditions:
THREE CONDITIONS OF PARTITION
1.) Pi does not contain the empty set
Pi ≠ { ∅ }
2.) The union of the subsets must equal the entire original set.
Therefore, every element of S must be in exactly one element of P.
   [ P1 ∪ P2 ∪ ... ∪ Pn = S ]
3.) The intersection of any two distinct set is empty.
Pa ∩ Pb = { ∅ }
S= {1, 2, 3}
P= { (2) , (1, 3), ( ) }Not partition
P= { (1) , (2) } Not partition
P= { (1, 3) , (2, 3) } Not partition
P= { (1), (2), (3) } PARTITION
P= { (2) , (1, 3) } PARTITION
S = { A, B, C, D, E, F, G,
H }