Scribd
Upload
26 views

Assignment 3 Landasan Matematika: Arranged by Group 3 Name/Nim

This document contains an assignment for a mathematics course. It includes: 1. Details of the student group submitting the assignment, including their names and student IDs. 2. An outline of the topics covered in the assignment, including universal and empty sets, finite sets and counting principles, classes and power of sets, and cardinality concepts. 3. Examples and explanations of each topic, such as the definition of universal and empty sets, formulas for calculating sizes of unions and intersections of finite sets, properties of power sets, and how to determine the cardinality of a set.

Uploaded by

Rendy B. Suharsono
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
26 views

Assignment 3 Landasan Matematika: Arranged by Group 3 Name/Nim

This document contains an assignment for a mathematics course. It includes: 1. Details of the student group submitting the assignment, including their names and student IDs. 2. An outline of the topics covered in the assignment, including universal and empty sets, finite sets and counting principles, classes and power of sets, and cardinality concepts. 3. Examples and explanations of each topic, such as the definition of universal and empty sets, formulas for calculating sizes of unions and intersections of finite sets, properties of power sets, and how to determine the cardinality of a set.

Uploaded by

Rendy B. Suharsono
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

ASSIGNMENT 3

LANDASAN MATEMATIKA

ARRANGED BY GROUP 3
NAME/NIM:

1. ADELLA SEKAR NINGRUM/ 19029129


2. HAFIZATUNNISA/ 19029020
3. RENDY B SUHARSONO/ 19029044

STUDY PROGRAM : PENDIDIKAN MATEMATIKA

DOSEN : RONAL RIFANDI, S.Pd, M.Sc

MATEMATIKA S-1

FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM

UNIVERSITAS NEGERI PADANG

2019/2020
A. Universal Sets and Empty Sets
1. Universal Sets
Universal sets is a set that contains all the members or objects / elements that
are the topic of conversation. The set of universes is expressed as S or U.
Example:
a. A = {Jazz, Pajero, Alphard, Lamborgini, Innova, Avanza}
Determine the possible universal sets of A!
Answer:
The possible universal set from set A is
S = {Four-wheeled vehicle}

b. K = {Cow, Buffalo, Horse, Goat, Deer, Dog}


Determine the possible universal sets of K!
Answer:
The possible universal set from set K are
K = {Four-legged animal}
K = {Mammals}
K = {Four-legged mammals}

c. S = {1,2,3,4,5,6,7,8}
A = {1,4,6,7}
B = {2,4,5,8}
A ∪ B = {1,2,4,5,6,7,8}
A ∩ B = {4}

AUB A∩B
2. Empty Sets
Empty sets is a set that has no members or set elements. An empty set is
symbolized by “{}” or “∅”.
Example:
a. K = {Prime numbers between 7 and 11}
K is an empty set because between 7 and 11 there are no prime numbers.
Notated K = {}.
b. L = {x | 7 ˂ x ˂ 9, x ∈odd numbers }
L is empty set because between 7 and 9 there are no odd numbers.
Notated L = {}.
c. M = {prime numbers even}
M is empty set because no prime numbers are even. Notated M = ∅.

B. Finite Sets and Counting Principles


A set is said to be finite if it contains have well-defined range. For examples, the
null set and the set of alphabet are finite sets, so that set of even negative integers {2,
4, 6, . . . .} is infinite.
Notation : n(A) or |A|
First begin with a special case
Lemma 1.5 : suppose Aand B are finite disjoint sets. Then A ∪ B is finite set

n(A ∪B ) = n(A) + n(B)

In counting the elements of A ∪B, first count thosethat are in A. There are n(A) of
these. Yhe only other elements of A ∪B are those that are in B but not in A. Since A
and B are disjont, no element of B is in A so there are n(B) elements that are in B but
not in A.
Therefore, n(A ∪B ) = n(A) + n(B), as claimed.
Remark : A set C is called the disjoint union of A and B if ,

C = A ∪B and A∩B=∅
Special Case of Disjoint Unions
There are two special case of it.
1. Given any set A, then the universal set U is the disjoint union of A and its
complement Ac.

n(U) = n(A) + n(Ac)

Theorem 1.6 : let A be any set in a finite universal set U

n(Ac) = n(U) + n(A)

For example, if there are 15 students like math in a class of 40 students, then there
are 40 – 15 = 25 students do not like math.

Theorem 1.7 : suppose A and B are finite sets


1. Given any set A and B, that A is the disjoint union of A\b and A ∩ B.

n(A\B) = n(A) – n(A ∩ B)

For example, suppose an archery class A contaiins 32 students, and 15 of them are
also in a dancing class B. So that

n(A\B) = n(A) – n(A ∩ B) = 32 – 15 = 17

that is, there are 17 students in the class A who are not in class B.

Theorem 1.8 : suppose A and B are finite sets.

n(A ∩ B) = n(A) + n(B) – n(A ∩ B)

EXAMPLE :
Consder the following data among 230 studets in a college dormitory.
120 students are on a list A (taking math)
80 students are on list B (taking management)
30 students are on both list.
Find the number of student :
a. On neither list
b. On exactly one of the two list
c. On list or B
Answer :
a. The students on neither the A list nor the B list form the set Ac ∩ Bc . by De
Morgans Law, Ac ∩ Bc = (A U B)c.
Ac ∩ Bc = (A U B)c = n(U) – n(A U B) = 230 –170 = 60

b. List A contains 120 names and 30 of them are on the list B, hence 120 – 30 = 90
n(A\B) = n(A) – n(A U B) = 120 – 30 = 90
Similarly, list B contains 80 names and 30 of them are on list A, hence 80 – 30 =
50names are only on list B.
n(B\A) = n(B) – n(A U B) = 80 – 30 = 50

c. n(A U B) = n(A) + n(B) – n(A ∩ B) = 120 + 80 – 30 = 170

C. Classes of Sets and Power of Sets


1. Classes of Sets/ Familes of Sets

 The members of a set are sets too.

 Or you can call that classes of sets are a set which all of the member are set.
Example:
1) P = {{1},{2},{1,2}}
P is Classes of Set, because all members of set P are Set.
2) Q = {{1},{2},3,{4}}
Q isn’t Class of set, because not all members of set Q are set, 3 isn’t a set.
3) M = {(a,b),(a,c),(b,c)}

2. Power of Sets

 Power of sets are the class of all sub-sets

 Or Power of sets are set that’s all subset of given set


 The power of set denoted by
P(Name of set) ={all subset of set}

 The number of power sets member can be known by using.


n(P(A)) = 2^n(A)

 The minimum member of Power sets are 1, That’s null set, null sets is always
a subset of every set.
Example:
1) A ={1,2,3}
P(A) = {A,{1}.{2},{3},{1,2},{1,3},{2,3},{ }}
n(p(A)) = 8

D. Cardinality Concept

 Number of element of given set

 Or the cardinality of a set A is the number of elements in A, which written as


|A|=3

 The cardinal in mathematics mean size.


Example:
1.|{a,b,c}| = 3
2.|{b,a,c}| = 3
3.|{4,5,1,2,5,6,2,5,2,1,3}| = |{1,2,3,4,5,6}| = 6
4.|{ }| = 0
5.|{0}| = 1
6.|{{1,2},{2,3}}| = 2

You might also like