Math 1100 Module 2
Math 1100 Module 2
Precise
Mathematical expressions or statements are precise, it has its own distinct meaning.
symbolically into
𝑥 < 𝑦
greatly simplifies the sentence.
The symbols retain the important and exact information and the context need only to be
referred to again when stating a solution.
1
This module is based from the book “Mathematics in the Modern World” by the Department of Mathematics and
Physics, CS, CLSU.
1
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
Concise
The language of mathematics is concise because it uses symbols instead of spelled-
out words for brevity.
By the use of symbols, mathematical expressions become brief, and ambiguities are
avoided.
Powerful
Mathematics is powerful because students can only perform efficiently in problem
solving if they understand the language of mathematics.
Example 3.
An example of expression can be as simple as 10 + 13.
We could change the (+) to make different mathematical expressions such as 10 – 13,
(10)(13), or 10 ÷ 13.
2
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
Addition, subtraction, multiplication, and division are called operations. There are many
more operations that can be used in a mathematical expression, which usually includes
numbers, sets, functions, ordered pairs, matrices, and others.
The following table lists the some key words used to express the four main operations.
Mathematical Operations
Usually, verbal phrases are translated into variable expressions to simplify them into
an equivalent form that usually involves fewer symbols and operations, or into a form
that is best suited to a current application, or into a preferred form or style
3
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
12
The quotient of 12 and a number
x
1
One half of a number x
2
The sum of five times a number and twelve 5𝑥 + 12
The product of six and twice a number (6)(2𝑥)
The square of a number 𝑥2
The square root of a number √𝑥
The cube of a number 𝑥3
The sum of the cube of a number and four x3 4
4
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
A mathematical sentence is a correct arrangement of mathematical symbols stating
a complete thought. The most common mathematical statements or sentences are called
equations and inequalities.
A mathematical sentence is one that makes a statement about the relationship of two
expressions. These two expressions are written in symbols such as numbers and
variables, or a combination of both. The relationship of the two expressions is usually
stated by using symbols or words such as
equals (=),
greater than (>),
greater than or equal (≥),
less than (<), or
less than or equal(≤).
1. 𝑥 − 1 > 3𝑥 + 1
2. 2𝑥 − 18 = 6𝑦 + 1
3. A square has 𝑥 sides.
In the above illustrations, the mathematical sentences may or may not be true
depending on the values of the variables 𝑥 and 𝑦. The truth or falsity of such a sentence
is open, depending on the values of the variables.
6
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
2. Basic Mathematical Concepts
Discussed below are fundamental concepts in mathematics; namely Sets, Functions and
Relations, Binary Operations, and Logic.
2.1 Sets
A set is a collection or grouping of elements. These elements can be anything such
as numbers, letters, names, sentences etc.
The capital letters 𝐴, 𝐵, 𝐶, … are usually used to name sets; if the elements are also letters,
the small letters 𝑎, 𝑏, 𝑐, … are used.
Describing sets
Roster (or List) Method
-The simplest way of describing a set is to just list its elements separated by commas
inside a pair of braces.
It easy to use especially if the set has only a few elements no matter what they are.
Example: The set 𝐴 whose elements are 𝑎, 𝑏, and 𝑐 can be expressed as:
𝐴 = {𝑎, 𝑏, 𝑐}
Other examples:
𝐵 = {𝑚, 𝑎, 𝑡, ℎ}
𝐶 = {book, pen, paper, scissors}
𝐷 = {– 2, 1, 3, 5, 8, 9, 11, 2020}
Example:
7
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
We call the number of elements of any set 𝐴 as the cardinal number of 𝐴. It is
denoted as |𝐴|.
Example: If 𝐴 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒, 𝑓, 𝑔, ℎ}, then |𝐴| = 8.
Definition:
Set 𝐴 is a subset of set 𝐵, written 𝐴 ⊂ 𝐵, if every member of 𝐴 is also a member of 𝐵.
Otherwise, we write 𝐴 ⊄ 𝐵, read “𝐴 is not a subset of 𝐵” to mean there is at least one
element of 𝐴 that is not in 𝐵.
Example:
Given 𝐴 = {𝑎, 𝑏, 𝑐, 𝑑} and 𝐵 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒}.
Then 𝐴 ⊂ 𝐵 because all members of 𝐴 are members of 𝐵.
On the other hand, 𝐵 ⊄ 𝐴 because 𝑒 ∈ 𝐵 but 𝑒 ∉ 𝐵.
It follows from the definition that any set 𝐴 is a subset of itself, i.e., 𝐴 ⊂ 𝐴.
Definition:
Any set that has no element at all is called a null (or empty) set, denoted by { } or 𝜙.
Definition:
Any set that contains all elements under consideration is called a universal set, denoted
by U.
Whenever necessary in any discussion, the universal set is always given or identified.
8
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
Operations On Sets
Given a list of sets, other sets may be formed by performing one or more operations on
the given sets. Basically these operations are the union (∪), intersection (∩), complement
(′), difference (−), and the Cartesian or cross product (×).
Union
The union (∪) operation combines all elements of two sets.
Any element that occurs in both sets only occurs once in the new set.
Example:
If 𝐴 = {𝑎, 𝑏, 𝑐} and 𝐵 = {𝑐, 𝑑, 𝑒} then 𝐴 ∪ 𝐵 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒}.
If 𝐶 = {1, 2, 3, 5} and 𝐷 = {2, 4,6} then 𝐶 ∪ 𝐷 = ______________. (Answer2)
Intersection
The intersection (∩) operation contains all elements found in two sets.
In other words, the intersection of two sets contains only the elements common to both
sets.
Example:
1. If 𝐴 = {𝑎, 𝑏, 𝑐} and 𝐵 = {𝑏, 𝑐, 𝑑, 𝑒} then
a. 𝐴 ∩ 𝐵 = {𝑏, 𝑐}
b. (𝐴 ∩ 𝐵) ∪ 𝐵 = {𝑐, 𝑑, 𝑒}
Complement
The complement (′) of a set, denoted 𝐴’, identifies the elements of the universal set 𝑈
that are not in 𝐴.
Examples:
1. If 𝐴 = {𝑥, 𝑦} and 𝑈 = {𝑥, 𝑦, 𝑧}, then 𝐴’ = {𝑧}.
2. If 𝐶 = {2, 4, 6, 8} and 𝑈 = {1, 2, 3, 4, 5, 6, 7, 8, 9} then 𝐶 ′ = _______. (Answer4)
3. Ø’ = 𝑈
2
𝐶 ∪ 𝐷 = {1, 2, 3,4,5,6}
3
𝐶 ∩ 𝐷 = {2}
4
𝐶′ = {1, 3, 5, 7, 9}
9
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
Difference
The difference of two sets 𝐴 and 𝐵, denoted 𝐴 − 𝐵, is defined to be the set whose
elements are those of 𝐴 that are not in 𝐵.
Example:
If 𝐴 = {𝑎, 𝑏, 𝑐} and 𝐵 = {𝑐, 𝑑, 𝑒}, then
a. 𝐴 − 𝐵 = {𝑎, 𝑏}
b. 𝐵 – 𝐴 = {𝑑, 𝑒}.
Cartesian Product
The Cartesian Product or Cross Product of two sets 𝐴 and 𝐵, denoted 𝐴 × 𝐵, is the
set of all ordered pairs (𝑥, 𝑦), such that 𝑥 ∈ 𝐴 and 𝑦 ∈ 𝐵.
Example:
If 𝐴 = {𝑎, 𝑏} and 𝐵 = {1, 2, 3}, then
a. 𝐴 × 𝐵 = {(𝑎, 1), (𝑎, 2), (𝑎, 3), (𝑏, 1), (𝑏, 2), (𝑏, 3)}
b. 𝐵 × 𝐴 = {(1, 𝑎), (1, 𝑏), (2, 𝑎), (2, 𝑏), (3, 𝑎), (3, 𝑏)}
Note: (3, 𝑎) ∉ 𝐴 × 𝐵
10
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
2.2 Functions and Relations
Example:
The set 𝑅 = {(1, 2), (3, 4), (5, 6)} is a relation.
The first components 1, 3, 5 of the ordered pairs are respectively related to the second
components 2, 4, 6. The set {1, 3, 5} is called the domain of the relation while the set
{2, 4, 6} is called its range.
Consider the relation 𝐴 = {(1, 𝑎), (2, 𝑏), (3, 𝑏), (2, 𝑑), (1, 𝑒)}.
What is its domain? How about its range? (Answer5)
Illustrations:
1. The relation 𝐵 = {(1,2), (2,3), (3,4), (4,5), (5,6)} is a function.
2. The relation 𝐶 = {(1,2), (𝟐, 𝟑), (4,5), (𝟐, 𝟕)} is not a function.
Ordered pairs (2,3) and (2,7) have the same first components.
Aside from observing functions and relations in sets of ordered pairs, they may also
be described in other ways such as in graphs, and most often in equations that specify
the relationship between two variables 𝑥 and 𝑦.
In equations, functions are exclusively identified with the notation
𝑦 = 𝑓(𝑥).
With this notation, the function is given the name 𝑓; 𝑥 is called the independent
variable (also called argument) and 𝑦 is the dependent variable. The value of 𝑦 depends
upon the value of 𝑥.
5
Domain: {1, 2, 3} ; Range: {𝑎, 𝑏, 𝑑, 𝑒}
11
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
Say, the machine (function 𝑓) is a juice-maker. If we put in a mango, then mango
juice will come out; if we put in a pineapple, then pineapple juice comes out. But if we
put in a stone (not in its domain!), what happens? Functions are similar to the machine.
Then, 𝑓(7) means inputting 7 into function f which processes it accordingly as 2(7) + 3
that produces the output 17.
Depending on how the function is defined (how the machine is designed), inputs
(expressions) are processed accordingly to produce an output.
Example: Consider 𝑓(𝑥) = 3𝑥 2 – 5𝑥 + 2 and 𝑔(𝑥) = 2 – 3𝑥. Find each of the following:
a. 𝑓(2) d. 𝑓(1/2) – 𝑔(2) + 3/2
b. 𝑔(– 3/2) e. 𝑓(3) + 𝑔(2𝑥– 7)
c. 𝑓(– 2) – 𝑔(4/3) f. 𝑓(𝑔(𝑥))
Solutions.
a. 𝑓(2) = 3(2)2 – 5(2) + 2 = 3(4) – 10 + 2 = 4
3 3 9 13
b. 𝑔 (– ) = 2 – 3 (– ) = 2 + =
2 2 2 2
4 4
c. 𝑓 (– 2) − 𝑔 ( ) = [3(– 2)2 – 5(– 2) + 2] − [2 – 3 ( )]
3 3
= [12 + 10 + 2] – [2 – 4]
= 24 – (– 2)
= 26
1 2 1 2 1 3
d. 𝑓 ( ) – 𝑔(2) + = [3 ( ) – 5 ( ) + 2] – [2 – 3(2)] +
2 3 2 2 2
3 5 3
= [ – + 2] – [2 – 6] +
4 2 2
1 3
= – [– 4] +
4 2
23
=
4
12
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
e. 𝑓(3) + 𝑔(2𝑥– 7) = [3(3)2 – 5(3) + 2] + [2 – 3(2𝑥– 7)]
= [14] + [2 – 6𝑥 + 21]
= 37 − 6𝑥
13
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
2.3 Binary Operations
A binary operation on a set is a rule for combining two elements of the set, to produce
another element of the same set. A binary operation * defined on a non-empty set 𝑆 is
a rule that assigns to each ordered pair (𝑎, 𝑏) of elements of 𝑆 a unique element 𝑎*𝑏 ∈
𝑆.
Illustrations:
1. On the set of natural numbers 𝑁 = {1, 2, 3, 4, 5, . . . }, addition and multiplication
are binary operations because adding or multiplying any two elements of 𝑁
produces an element that also belongs to 𝑁.
1. Closure Property
The binary operation * defined on a set 𝐴 is closed on set 𝐴 if and only if
𝒂*𝒃 ∈ 𝑨 for any 𝒂, 𝒃 ∈ 𝑨.
Example:
The binary operation addition “+” is closed on the set of integers because when we add
any two integers, the result is also an integer.
However, division “/” is not closed on the set of integers because when we divide any
two integers such as 5/3, the result may happen to be not integer.
2. Commutative Property
A binary operation* defined on a set A is said to be commutative if
𝒂*𝒃 = 𝒃*𝒂 for any 𝒂, 𝒃 ∈ 𝑨.
Example:
The binary operations addition and multiplication are commutative on the set of real
numbers.
6
If you consider two elements in 𝑁, say 1 and 5, 1 − 5 = −4 or 1 ÷ 5 = 1/5 is not an element of 𝑆. So subtraction
and division are not binary operations in 𝑁.
14
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
3. Associative Property
A binary operation * defined on a set 𝐴 is said to be associative if
(𝒂*𝒃)*𝒄 = 𝒂*(𝒃*𝒄) for any 𝒂, 𝒃, 𝒄 ∈ 𝑨.
Example:
Both addition and multiplication are associative operations on natural numbers.
Subtraction is not an associative operation because for example,
(11 – 18) – 7 ≠ 11 – (18 – 7) .
Example:
In the set of real numbers, the identity element for multiplication is 1 while the identity
element for addition is 0.
Example:
In the set of integers ℤ, every element has an additive inverse.
However, not one of the elements has a multiplicative inverse.
In the set of whole numbers 𝑊 = {0, 1, 2, 3, 4, . . . }, the only element that has an additive
inverse is zero; its inverse is itself.
15
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
2.4 Elementary Logic
Logic is the primary basis of all mathematical reasoning. As such, it is concerned with the
investigation of consequences that hold between the premises and the conclusion of a
sound argument.
Statements (Propositions)
A statement (or proposition) is the basic building block of logical reasoning. It is a
declarative sentence that is either true or false, but not both. If it is true, its truth value
is said to be T (true); otherwise, it is an F (false).
Illustrations:
1. “10 + 12 = 22” is a statement that is true.
2. “The letter s is a vowel” is a statement that is false.
3. “Samsung creates cellphones” is a statement that is true.
4. “Samsung creates the best cellphones” is not a statement;
it is an opinion that may be true to some people but false to others.
5. “2𝑥 + 5 = 𝑦 − 3” is not a statement;
it is sometimes true and sometimes false.
Statements are commonly represented by small letters; most frequently used are p, q, r,
s, and t.
For example, the statement “It is raining” may be represented by p as in the following:
p: It is raining.
Compound Statements
Statements constructed by connecting one or more simpler statements are
called compound statements. The simpler statements are connected together by
using connectives such as “not”, ‘‘and”, “or”, “if…then”, “only if”, and “if and only if”.
Example:
“Ben donated ₱10,000 and he did not take a bath or attended his class”
is a compound statement that is composed of 3 simpler statements:
p: Ben donated P10000.
q: He did not take a bath.
16
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
r: He attended his class.
To determine the truth value of a compound statement, we need to first consider and
examine the way the simpler statements are connected. The resulting compound
statement can be a negation, a conjunction, a disjunction, an implication, a double
implication or any combination of these.
Negation (¬)
The negation of a statement is denial of the statement. To negate a statement, the
symbol ¬ is used. To illustrate,
Statement Negation
p: It is raining. ¬p: It is not raining.
s: All CLSU students are optimistic. ¬s: Not all CLSU students are optimistic.
Note:
“All CLSU students are not optimistic.”
is not a negation of s (why?)
The statement “r: Some classmates are upperclassmen.” means that at least one of the
classmate is upperclassman. The negation of the statement should mean that none of
the classmates are upperclassmen.
The statement “s: All CLSU students are optimistic.” means that every CLSU student is
optimistic. The negation of the statement should mean that there is at least one CLSU
student that is not optimistic.
A negation is true T if and only the statement itself is false F. Similarly, a negation is false
F if and only the statement itself is true T.
17
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
Conjunction (∧)
A conjunction consists of 2 or more simpler statements that are connected by the word
“and ”, represented by the symbol ∧. That is, the conjunction p ∧ q represents the
compound statement “p and q”.
A conjunction of 2 statements p and q is true if and only if both p and q are true.
Disjunction (∨)
A disjunction consists of 2 or more simpler statements that are connected by the word
“or ”, represented by the symbol ∨. That is, the conjunction p ∨ q represents the
compound statement “p or q”.
A disjunction of 2 statements p and q is true if and only if at least one of p and q is true.
18
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
Implication ( )
An implication (also called conditional) consists of two cause-and-effect statements. One
is a premise and the other is a consequence that are connected by the words “if…then”.
The symbol is used. That is, the implication p q represents the compound
statement “if p then q”. Equivalently, it means
Illustration: p: It is raining.
q: The ground is wet.
p q: If it is raining then the ground is wet.
¬p q: If it is not raining then the ground is wet.
Sometimes, we are interested in taking the converse, the inverse, or the contrapositive
of an implication p q. These are defined as
Converse : q p
Inverse: ¬p ¬q
Contrapositive: ¬q ¬p
Example:
Statement: If you are more than 60 years old, then you are entitled to a senior
citizen’s card.
Converse: If you are entitled to a senior citizen’s card, then you are more than 60
years old.
Inverse: If you are not more than 60 years old, then you are not entitled to a
senior citizen’s card.
Contrapositive: If you are not entitled to a senior citizen’s card, then you are not more
than 60 years old.
19
MATH 1100
Department of Mathematics and Physics
1st sem SY 2020-2021
Double Implication ( )
A double implication (also called biconditional) is a statement of the form
(p q) (q p),
and is written as p q.
A biconditional p q is considered true if and only if p and q are both true or are both
false.
Quantifiers
Some statements are made to refer to a specific case, or refer only to a few, or refer to
every case. This is called quantification of the statement. Such quantification can be done
with two quantifiers; namely the universal quantifier (∀) and the existential
quantifier (∃).
Statement Interpretation
∀ 𝑥 ∈ 𝐴, 𝑃 (𝑥 ) For any 𝑥 in the set 𝐴, the statement 𝑃(𝑥) is true
∃ 𝑥 ∈ 𝐴 , 𝑃 (𝑥 ) There exists an 𝑥 in 𝐴 so that 𝑃(𝑥) is true.
Examples:
1. ∀𝑥 ∈ ℝ, ∃𝑦 ∈ ℕ, 𝑥 2 − 𝑦 2 = 0
Read as: “For any 𝑥 in the set ℝ of real numbers, there exists 𝑦 in the set ℕ of natural
numbers where the square of 𝑥 minus the square of 𝑦 is 0.”
Both 𝑥 and 𝑦 are bound.
Here ℝ is the set of real numbers and ℕ is the set of natural numbers. The statement is
false. If we consider a real number say 2.1 there is no natural number that satisfies 𝑥 2 −
𝑦 2 = 0.
2. ∃𝑥, 𝑦 ∈ ℤ, 3𝑥 + 2𝑦 > 7
Read as: “There exist 𝑥 and 𝑦 in the set ℤ of integers where 3𝑥 plus 2𝑦 is greater than
7.”
Both 𝑥 and 𝑦 are bound.
The statement is true. We are only concerned if we can find two integers 𝑥 and 𝑦 that
satisfy 3𝑥 + 2𝑦 > 7. We can pick 𝑥 = 1 and 𝑦 = 3 so that 3𝑥 + 2𝑦 = 3(1) + 2(3) = 9
which is greater than 7.
3. ∀𝑥 ∈ ℤ, √𝑥 + 𝑦 > 0
Only 𝑥 is bound, 𝑦 is free.
The statement is false. When 𝑥 is an integer say 𝑥 = 5 and 𝑦 = −7, √𝑥 + 𝑦 = √5 + (−7)
is not greater than 0.
21