Scribd
Upload
117 views5 pages

Assessment 2

The document provides examples and explanations of set theory and logic concepts including: - Writing logical statements in words using propositional logic - Constructing truth tables for logical statements - Proving De Morgan's laws with a truth table - Performing set operations like union, intersection, complement and determining their results - Drawing and analyzing a Venn diagram to solve a word problem about customer purchases The document contains explanations and examples to demonstrate understanding of foundational concepts in logic and set theory.

Uploaded by

Leane Zapanta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
117 views5 pages

Assessment 2

The document provides examples and explanations of set theory and logic concepts including: - Writing logical statements in words using propositional logic - Constructing truth tables for logical statements - Proving De Morgan's laws with a truth table - Performing set operations like union, intersection, complement and determining their results - Drawing and analyzing a Venn diagram to solve a word problem about customer purchases The document contains explanations and examples to demonstrate understanding of foundational concepts in logic and set theory.

Uploaded by

Leane Zapanta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Zapanta, Arlyn Leane M.

BSBAMMOUM 1-A

MATH IN THE MODERN WORLD

Assessment 2

1. Write each statement in words. Let p: The plane is on time. Let q: The sky is clear.

(a) 𝑝 ˄ (¬ 𝑞)
The plane is on time and the sky is not clear.
(b) 𝑞 ⟶ (𝑝 ˅ ¬ 𝑝)
If the sky is clear then the plane is on time or the plane is not on time.
(c) 𝑝 ↔ 𝑞
The plane is on time if only if the sky is clear.

2. Construct a truth table for each proposition.

(a) [(𝑝 ˄ 𝑞) ˅ 𝑟] ↔ [(𝑝 ˄ 𝑟) ˅ (𝑞 ˄ 𝑟)]

p q r P^q (p ^ q) v r P^r Q^r (p ^ r) v (q ^ r)


T T T T T T T T
T T F T T F F F
T F T F T T F T
F T T F T F T T
T T F T T F F F
T F T F T T F T
F T T F T F T T
F F F F F F F F
(b) [(𝑝 ˄ 𝑟) ⟶ (𝑞 ˄ ¬𝑟)] ⟶ [(𝑝 ˄ 𝑞) ˅ 𝑟)]

p q r ¬r p^r q ^ ¬r p^q (p ^ q) v r
T T T F T F T T
T T F T F T T T
T F T F T F F T
F T T F F F F T
T T F T F T T T
T F T F T F F T
F T T F F F F T
F F F T F F F F

3. Prove the De Morgan’s Laws by constructing truth tables

Given: ~ (p v q) = ~p ^ ~q

p q ~p ~q pvq ~ (p v q) ~p ^ ~q

T T F F T F F

T F F T T F F

F T T F T F F

F F T T F T T

4. Let U = Letters in the English Alphabet = {a, b, c, . . ., x, y, z}

A = {t, r, i, a, n, g, l, e, s}
B = {s, q, u, a, r, e}
C = {h, e, x, a, g, o, n, s}

Determine the following:

(a) 𝑨 ⋃ (𝑩 ⋂ 𝑪)
𝐴 ⋃ (𝐵 ⋂ 𝐶) = {t, r, i, a, n, g, l, e, s} ⋃ {s, q, u, a, r, e} ⋂ {h, e, x, a,
g, o, n, s}
= {t, r, i, a, n, g, l, e, s} ⋃ {a, e}
𝐴 ⋃ (𝐵 ⋂ 𝐶) = {t, r, i, a, n, g, l, e, s, a, e}
(b) (𝑨 ⋃ 𝑩)′ ⋂ 𝑪
(Α ⋃ Β)’ = 𝒰 - (Α ⋃ Β)
= {a, b, . . ., y, z} - {t, r, i, a, n, g, l, e, s, q, u}
(Α ⋃ Β)’ = {b, c, d, f, h, j, k, m, o, p, v, w, x, y, z}
(𝐴 ⋃ 𝐵)′ ⋂ 𝐶 = {b, c, d, f, h, j, k, m, o, p, v, w, x, y, z} ⋂ {h, e, x, a,
g, o, n, s}
(𝐴 ⋃ 𝐵)′ ⋂ 𝐶 = {h, z, o, s}
(c) (𝑨 ⋂ 𝑪) ⋃ (𝑩 ⋂ 𝑪)
(𝐴 ⋂ 𝐶) = {t, r, i, a, n, g, l, e, s} ⋂ {h, e, x, a, g, o, n, s}
(𝐴 ⋂ 𝐶) = {a, g, e, n, s}
(𝐵 ⋂ 𝐶) = {s, q, u, a, r, e} ⋂ {h, e, x, a, g, o, n, s}
(𝐵 ⋂ 𝐶) = {s, a, e}
(𝐴 ⋂ 𝐶) ⋃ (𝐵 ⋂ 𝐶) = {a, g, e, n, s} ⋃ {s, a, e}
(𝐴 ⋂ 𝐶) ⋃ (𝐵 ⋂ 𝐶) = {a, g, e, n, s}
(d) 𝑨 ⋂( 𝑪 ⋂ U)’
C⋂𝒰 = {h, e, x, a, g, o, n, s} ⋂ Letters in English alphabet
C⋂𝒰 = {h, e, x, a, g, o, n, s}
𝐴 ⋂( 𝐶 ⋂ U) = {t, r, i, a, n, g, l, e, s} ⋂ {h, e, x, a, g, o, n, s}
𝐴 ⋂( 𝐶 ⋂ U) = {a, n, g, e, s}

(e) n [(𝑨 ⋃ 𝑩) ⋂ (𝑩 ⋃ 𝑪 )]
A⋃B = {t, r, i, a, n, g, l, e, s} ⋃ {s, q, u, a, r, e}
A⋃B = {t, r, i, a, n, g, l, e, s, q, u}
B⋃C = {s, q, u, a, r, e} ⋃ {h, e, x, a, g, o, n, s}
B⋃C = {s, q, u, a, r, e, h, x, g, o, n}
(A ⋃ B) ⋂ (B ⋃ C) = {t, r. i, a, n, g, l, e, s, q, u} ⋂ {s, q, u, a, r, e, h, x, g,
o, n}
(A ⋃ B) ⋂ (B ⋃ C) = {r, a, n, g, e, s, q, u}

o n (𝐴 ⋃ 𝐵) ⋂ (𝐵 ⋃ 𝐶 )]= 8

5. A survey of 90 customers was taken at Barnes & Noble regarding the type of books purchased.
The survey found that 44 purchased mysteries, 33 purchased science fiction, 29 purchased
romance novels, 13 purchased mysteries and science fiction, 5 purchased science fiction and
romance novels, 11 purchased mysteries and romance novels, and 2 purchased all three types of
books (mysteries, science fiction, romance novels). How many of the customer surveyed
purchased?

The number of customer n (⋃) = 90


The number of customers purchased mysteries n (m) = 44
The number of customers purchased science fiction n (s) = 33
The number of customers purchased romance novels n (r) = 29
The number of customers purchased mysteries and science fiction n (m ⋂ s) = 13
The number of customers purchased science fiction and romance novels n (s ⋂ r) 5
The number of customers purchased mysteries and romance novels n (m ⋂ r) = 11
The number of customers purchased all three types of books (mysteries, science fiction,
romance novels) n (m ⋂ s ⋂ r) = 2

Venn diagram can be shown us


(a) mysteries only?
= n (m) + n (m ⋂ s ⋂ r) – n (m ⋂ s) – n (m ⋂ r)
= 44 = 2 – 13 -11

= 24

(b) mysteries and science fiction, but not romance novel?


= n (m ⋂ s) – n (m ⋂ s ⋂ r)
= 13 – 2

= 11

(c) mysteries or science fiction?


= n (m) + n (s) – n (m ⋂ s)
= 44 + 33 – 13

= 64

(d) romance novels or mysteries, but not science fiction?


= n (m ⋃ r) – n (s ⋂ r) – n (m ⋂ r) + (m ⋂ s ⋂ r)
= 64 – 5 – 11 +2

= 50

(e) exactly two types (mysteries, science fiction, romance novels)?


= n (m ⋂ s) + n (s ⋂ r) – 3 x n (m ⋂ s ⋂ r)
= 13 + 15 + 11 – 2 x 3

= 23

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy