REVIEW MODULE: MATHEMATICS (ALGEBRA)

SET THEORY
A set is a gathering together into a whole of definite, distinct 4. In a city, 25% of the families have phone, 15% of the familirs
objects of our perception or of our thought—which are called have car, 65% of the families have neither phone not car and
elements of the set 2000 families have both phone and car.

Cardinality of a set- “the number of members of ‘S’” usually a) Determine the percentage of families having phone and car.
denoted as |𝑆| or n(S)
b) Determine the percentage of families having either phone
Special Sets or car.

{} 𝑜𝑟 ∅ - Null Set or empty Set c) Determine the number of families in the city

{x} or x- unit set, which contains exactly one element

5. Consider the following data for 120 mathematics students.
P- set of all prime numbers 65 study French 20 study French and German
N-the set of all natural numbers 45 study German 15 study French and Russian
42 study Russian 15 study German and Russia
Z- the set of all integers 8 study all three languages
a.) Find the number of students studying at least one of the
Q- the set of all rational numbers three languages.
R- the set of all real numbers b) Find the number of students studying exactly one
C- the set of all complex numbers language.

H- denotes the set of all quaternions c.) Find the number of students studying exactly two
languages.
UNION

The union of A and B denoted as 𝐴 ∪ 𝐵 is the set of all things

that are members of A or B

INTERSECTION

The Intersection of A and B denoted as 𝐴 ∩ 𝐵 is the set of all

things that are members of A and B

1. Let A={3,5,7}, B={2,3,4,5,6} and suppose 𝐴 ∪ 𝐵 = 𝑼 .

Determine (𝐴 ∩ 𝐵)𝑐 .

2. Let 𝑈 = {𝑥 ∈ 𝑁: 1 ≤ 𝑥 ≤ 10} be the universal set, N being

the set of natural numbers. If 𝐴 = {1,2,3,4} and 𝐵 = {2,3,6,10},
then what is the complement of (A-B)?

3. Determine the Equivalent set for the following

a) 𝐴 ∪ 𝐴′ b) U’ c) (𝐴 ∪ 𝐵) ∩ 𝐵 d) 𝐴 ∩ 𝐴′

4. If A and B are proper subsets of a set X, then

{𝐴 ∩ (𝑋 − 𝐵)} ∪ 𝐵 equal to.

Principle of inclusion and exclusion

Provides an organized method to find the number of elements

in the union of a given group of sets, the size of each set, and
the size of all possible intersections among the sets
𝑛 𝑛

|⋃ 𝐴1 | = ∑|𝐴1 | − ∑|𝐴𝑖 ∩ 𝐴𝑗 |
𝑖=1 𝑖=1

+ ∑ |𝐴𝑖 ∩ 𝐴𝑗 ∩ 𝐴𝑘 | − ⋯ + (−1)𝑛−1 |𝐴𝑖

𝑖<𝑗<𝑘
∩ … ∩ 𝐴𝑛 |