REVIEWER FOR MMW

I. The Nature Of Mathematics ❖ Fibonacci Sequence - set of any

steadily increasing numbers where
MATHEMATICS each number is equal to the sum of
- a formal system of thought for the preceding two numbers. (1 and
recognizing, classifying, and 1, first two numbers)
exploiting patterns. ❖ Golden Ratio
- Defined as the study of numbers ➢ first studied by the ancient
and arithmetic operations. Greek because of its
- Set of tools or a collection of skills frequent appearance in
that can be applied to questions of geometry.
“how many”or “how much”. ➢ often represented by the
- a science which involves logical Greek letter τ (tau) which
reasoning, drawing conclusions from means “the cut” or “the
assumed premises, systematized section” in Greek.
knowledge, and strategic reasoning ➢ Mark Barr (early 18th
based on accepted rules, laws, or century) represented the
probabilities. golden ratio as ϕ (phi)
- an art which studies patterns for because it is the first letter in
predictive purposes or as a the name of Greek architect
specialized language which deals and sculptor Phidias who’s
with form, size, and quantity. work often symbolized the
golden ratio.
PATTERNS ➢ came from to a line segment
- Are regular, repeated, or recurring divided according to the
forms or designs. golden ratio where the larger
- help students in identifying part is to the smaller part as
relationships and finding logical the whole part is to the larger
connections to form generalization part.
and make predictions. ➢ the value of phi in decimal
form is approximately equal
SEQUENCE to 1.618…
- an ordered list of numbers, called ➢ EXAMPLE: Epidaurus
terms, that may have repeated Theatre, Parthenon, CN
values. Tower.
- The arrangement of these terms is
set by a definite rule.
❖ Arithmetic Sequence - the
difference of any two adjacent
terms is constant. The constant
difference is equal to the common
difference denoted by d.
❖ Geometric Sequence - any two
adjacent terms have a common
ratio denoted by r.

Made with love by Karylle ;]

 REVIEWER FOR MMW

II. Characteristics & Conventions In The equal sign = is one of the most popular
The Mathematical Language mathematical verbs.
Examples:
LANGUAGE ● The capital of the Philippines
- one of the most important things is Manila.
among people because it has an ● Rizal park is in Cebu.
important role in communication. ● 5+3=8
- Cambridge English Dictionary, ● 5+3=9
system of communication consisting
of sounds, words and grammar, or CONNECTIVES
the system of communication used - Used to connect objects of a given
by people in a particular country or type to get a ‘compound’ object of
type of work. the same type.
- Mathematics is very essential in MATHEMATICAL SENTENCE
communicating important ideas. But - the analogue of an English
most mathematical language is in sentence; it is a correct arrangement
the form of symbols. of mathematical symbols that states
a complete thought.
❖ Characteristics TRUTH OF SENTENCES
● precise (able to make very - The notion of “truth” (i.e., the
fine distinction) property of being true or false) is a
● concise (able to say things fundamental importance in the
briefly); and mathematical language.
● powerful (able to express CONVENTIONS IN LANGUAGES
complex thoughts with - Convention makes it easy for a
relative cases). reader to distinguish between a
❖ Comparison of Natural Language common noun (carol means
into Mathematical Language Christmas song) and proper noun
(Carol i.e. name of a person).
- Distinguish between different types
of mathematical expression.
EXPRESSION
- it is a correct arrangement of
mathematical symbols used to
represent a mathematical object of
interest.

❖ Expressions versus Sentences

In the mathematical sentence; 3 + 4 = 7
Explain: The verb is =. If you read the
sentence as ‘three plus four is equal to
seven, then it’s easy to hear the verb.

Made with love by Karylle ;]

 REVIEWER FOR MMW

CONVENTIONS IN MATHEMATICS,
SOME COMMONLY USED SYMBOLS, ITS
MEANING AND AN EXAMPLE

SETS AND LOGICS:

➢ ∪ (union) - union of set a and
set b (A∪B)
➢ ∩ (intersection) - intersection of
set a and set b (A∩B)
➢ ∈ (element) - x is an element of
A (x ∈ A)
➢ ∉ (not an element of) - x is not
an element of set A (x ∉ A)
➢ { } (A set of..) - A set of an element
({a, b, c})
➢ ⊂ (Subset) - A is a subset of B
(A ⊂ B)
➢ ⊄ (Not a subset of) - A is not a
subset of B (A ⊄ B)
➢ … (ellipses) - There are still other
items to follow/before (a, b, c, …)
➢ ∧ (Conjunction) - A and B (A ∧
B)
➢ ∨ (Disjunction) - A or B (A ∨ B)
➢ ~ (Negation) - Not A (~A)
➢ → (Implies (If-then statement)) -
If A, then B (A → B)
➢ ↔ (If and only if) - A if and only
if B (A ↔ B)
➢ ∀ (For all) - For all x (∀(x))
➢ ∃ (There exist) - There exist an
x (∃(x)) Translating words into symbol
Why do we need to translate mathematical
phrases into symbols?
- Practical problems seldom, if ever,
come in equation form. The job of
the problem solver is to translate the
problem from phrases and
statements into mathematical
expressions and equations, and then
to solve the equations.

- As problem solvers, our job is made

simpler if we are able to translate

Made with love by Karylle ;]

 REVIEWER FOR MMW

verbal phrases to mathematical

expressions and if we follow steps in
solving applied problems. To help us
translate from words to symbols, we
can use the Mathematics Dictionary.
- Mathematics uses symbols to
simplify complex or long
mathematical sentences.

MOST COMMONLY USED WORD or

PHRASE
➢ (for addition) Add, Added to; More
than; Increased by; the sum of; the
total of; plus
➢ (for subtraction) Subtract,
Subtracted to; subtract from; minus;
less; less than; Diminished by; take
away; reduced by; the difference;
minus
➢ (for multiplication) Multiply to;
product of; times; times as much of;
produce
➢ (for division) Divided by; quotient of;
the ratio of; divides
➢ (for exponent) Raised by a power of;
raised to the power of;
➢ (for equal sign) Is; yields

Made with love by Karylle ;]

 REVIEWER FOR MMW

III. Sets And Its Basic Operations - Two sets, say A and B, are
SET said to be equivalent if and
-
A formal mathematical term was only if they have the exact
introduced in 1879 by Georg Cantor. number of elements but they
- a collection of well-defined objects. are NOT identical.
- denoted with braces or curly - a 1 – 1 correspondence.
brackets { } ❖ Universal set; U = {x | x is
- Label or name the set by a capital consonant}
letter such as A, B, C,…etc. - the set of all elements under
ELEMENT of a set ; ∈ discussion.
- Each member of the set is called an ❖ Joint Sets
element and the ∈ notation means - Two sets, say A and B, are
that an item belongs to a set. said to be joint sets if and
- Each element in a set should be only if they have common
separated by comma. element/s.
❖ Disjoint Sets
TERMINOLOGIES of Sets - Two sets, say A and B, are
❖ Unit Set (Singleton) said to be disjoint if and only
- a set that contains only one if they are mutually exclusive
element. or if they don’t have common
❖ Empty set or Null set; ∅ element/s.
- a set that has no element.
❖ Finite set TWO WAYS of Describing a Set
- a set that the elements in a ➢ Roster or Tabular Method
given set are countable. - is done by listing or
❖ Infinite set tabulating the elements of
- a set that elements in a given the set.
set have no end or are not ➢ Rule or Set-builder Method
countable. - done by stating or describing
❖ Cardinal Number; n the common characteristics
- numbers that used to of the elements of the set.
measure the number of SUBSETS ; ⊆
elements in a given set. - a proper subset
- similar in counting the total - the number of subsets of a given set
number of elements in a set. is given by 2n , where n is the
❖ Equal set ; A = B (A = {a, c, e} and number of elements of the given set.
B = {c, a, e}) ➔ A subset of B, A ⊆ B, means
- Two sets, say A and B, are that every element of A is also
said to be equal if and only if an element of B.
they have an equal number ➔ If x ∈ A, then x ∈ B. In
of cardinalities and the particular, every set is a subset
element/s are identical. of itself, A ⊆ A.
- a 1 -1 correspondence.
❖ Equivalent set ; A ≡ B

Made with love by Karylle ;]

 REVIEWER FOR MMW

➔ A is a proper subset of B, if A ⊂ and it is denoted by Ac or A’ .

B and there is at least one Thus Ac or A’ is the set of
element of B that is not in A: everything that is not in A.
➔ If x ⊂ A, then x ⊂ B and there is Note:
an element b such that b ∈ B a) A ∪ A’ = U
and b ∉ A. b) n(A ∪ B) = n(A) + n(B) – n (A ∩ B)
NOTE: The empty set. or {} has no ❖ Cartesian Product
elements and is a subset of every set - Given sets A and B, the
for every set A, A ⊂ A. Cartesian product of A
and B, denoted by A x B
ORDERED PAIR and read as “A cross B”,
- Given elements a and b, the symbol is the set of all ordered
(a, b) denotes the ordered pair pair (a,b) where a is in A
consisting of a and b together with and b is in B.
the specification that “a” is the first Symbolically, A x B = {(a,
element of the pair and “b” is the b) | a ∈ A and b ∈ B}
second element. Note that A x B is not equal to B x A.
- (a, b) = (c, d) means that a = c and b
=d
OPERATION ON SETS
❖ Union of Sets; ∪
- The union of sets A and
B, denoted by A ∪ B , is
the set defined as: A ∪ B
= { x | x ∈ A or x ∈ B }
Note that elements are not repeated in a
set.
❖ Intersection of Sets ; ∩
- The intersection of sets A
and B, denoted by A ∩ B ,
is the set defined as : A ∩
B = { x | x ∈ A and x ∈
B}
❖ Difference of Sets
- The difference of sets A
from B , denoted by A -
B , is the set defined as A
- B = { x | x ∈ A and x ∉
B}
Note that in general A - B ≠ B - A
❖ Complement of Set
- For a set A, the difference U
- A , where U is the universe,
is called the complement of A

Made with love by Karylle ;]

 REVIEWER FOR MMW

IV. FUNCTIONS AND RELATIONS symmetric on a set of females. The

arrow diagram of a symmetric
WHAT IS RELATION? relation has the property that
❖ A relation from set X to Y is the set whenever there is a directed arrow
of ordered pairs of real numbers (x, from a to b, there is also a directed
y) such that to each element x of the arrow from b to a.
set X there corresponds at least one TRANSITIVE - A relation R on A is
element of the set Y. transitive if given a R b and b R c then a R
❖ Let A and B set. A relation (Rel) from c.
A to B is a subset of A x B. Given an Examples of transitive relations include:
ordered pair (x, y) in A x B, x is - "is equal to" (equality)
related to y by R, written x R y, if and - "is a subset of" (set inclusion)
only if, (x, y) is in R. The set A is - "is less than or equal to" and "is
called the domain of R and the set B greater than or equal to" (inequality)
is called its co-domain or range. - "divides" (divisibility).
The arrow diagram of a transitive relation
Notation: has the property that whenever there are
➢ The notation for a relation R may be directed arrows from a to b and from b to c
written symbolically as follows: then there is also a directed arrow from a to
- x R y meaning (x, y) ∈ R. c.
➢ The notation x R y means that x is Equivalence Relation - A relation that is
not related to y by R; reflexive, symmetric, and transitive is called
- x R y meaning (x, y) ∉ R. an equivalence relation on A.
Examples of equivalence relations include:
PROPERTIES OF RELATIONS - The equality ("=") relation between
real numbers or sets.
REFLEXIVE - A relation R on A is said - The relation "is similar to" on the set
to be reflexive if every element of A is of all triangles.
related to itself. In notation, a R a for - The relation "has the same birthday
all a ∈ A. as" on the set of all human beings.
Examples of reflexive relations include: What is a Function?
- "is equal to" (equality) - A function is a relation in which
- "is a subset of" (set inclusion) every input (domain) is paired with
- "is less than or equal to" and "is exactly one output (range).
greater than or equal to" (inequality) - A function from set X to Y is the set
- "divides" (divisibility). of ordered pairs of real numbers (x,
SYMMETRIC - A relation R on A is y) in which no two distinct ordered
symmetric if given a R b then b R a. pairs have the same first
Example: component. Similar to a relation, the
- "is married to" is a symmetric values of x is called the domain of
relation, while, "is less than" is not. the function and the set of all
The relation "is the sister of" is not resulting value of y is called the
symmetric on a set that contains a range or co-domain of the function.
brother and sister but would be

Made with love by Karylle ;]

 REVIEWER FOR MMW

- A relation f from a set A to a set B is

said to be function if every element
of set A has one and only one image Is a function a relation?
in set B. ● Focus on the x-coordinates, when
- In other words, a function f is a given a relation
relation such that no two pairs in the ● If the set of ordered pairs have
relation has the same first element. different x-coordinates (or the first
element of an ordered pair),
A function F from a set A to a set B is a - it IS A function
relation with domain and co-domain B that ● If the set of ordered pairs have same
satisfies the following two properties: x-coordinates,
- it is NOT a function but it
1. For every element x in A, there is an could be said a relation
element y in B such that (x,y) ∈F. Note:
2. For all elements x in A and y and z - Y-coordinates have no bearing in
in B, if (x,y) ∈ F and (x,z) ∈F, then y = determining functions
z - Function is a relation but relation
could not be said as function.
These two properties; (1) and (2) can be
stated less formally as follows: Vertical Line Test - a relation is a function
if a vertical line drawn through its graph,
1. Every element of A is the first element of passes through only one point.
an ordered pair of F.
2. No two distinct ordered pairs in F have Evaluating a Function
the same first element. ➢ f(x) means function of x and is read
“f of x.”
The notation f : X → Y means that f is a ➢ f(x) = y = 2x + 1 is written in function
function from X to Y. X is called the notation.
domain of f and Y is called the co-domain ➢ The notation f(1) means to replace x
of f. Given an element x ∈ X, there is a with 1 resulting in the function value.
unique element y in Y that is related to f(1) = 2x + 1
x. f(1) = 2(1) + 1
f(1) = 3
The unique element y to which f relates x is
denoted by f (x) and is called f of x, or the Given g(x) = x2 – 3, find g(-2) .
value of f at x, or the image of x under f. g(x) = x2 – 3; substitute -2 to a
variable x
The set of all values of f (x) taken together g(-2) = x2 – 3; so we get;
is called the range of f or image of X under g(-2) = (-2)2 – 3; simplifying
f. g(-2) = 1; and this is the value of g(-
Symbolically. 2) for x2 – 3

range of f = { y ∈ Y | y = f (x), for

some x in X}

Made with love by Karylle ;]

 REVIEWER FOR MMW

➢ Exactly ONE turning point, which is

also the VERTEX.
Operations on Functions Cubic Polynomial Functions
➢ Degree 3
❖ The sum or difference of f and g, ➢ Up to three x-intercepts.
denoted by f ± g is the function ➢ Up to two turning points.
defined by (f ± g)(x) = f(x) ± g(x). Quartic Polynomial Functions
❖ The product of f and g, denoted by f ➢ Degree 4.
· g is the function defined by (f·g)(x) ➢ Up to four x-intercepts.
= f(x)·g(x). ➢ Up to three turning points.
❖ The quotient of f and g denoted by
(f/g)(x) is the function defined by
f(x)/g(x), where g(x) is not equal to
zero.
❖ The composite function of f and g
denoted by f ο g is the function
defined by (f ο g)(x) = f(g(x)).
Similarly, the composite function of g
by f, denoted by g ο f, is the function
defined by ( g ο f)(x) = g(f(x)).

Types of Functions

If a polynomial of degree n defines a

function f, f is called a polynomial function of
degree n.
a) if f(x) is of degree 1, f is called a
linear function.
b) if the polynomial is of degree 2,
the function is called quadratic.
c) if the polynomial is of degree 3,
the function is cubic.
d) if the polynomial is of degree 4
and 5, the function is called quartic and
quintic respectively.

Linear Polynomial Functions

➢ Degree 1.
➢ One x-intercepts.
➢ No turning points.
Quadratic Polynomial Functions
➢ Degree 2 - parabola that opens up
or down.
➢ Zero, one or two x-intercepts.

Made with love by Karylle ;]

 REVIEWER FOR MMW

V. BINARY OPERATION ● Given that a ∗ b = a + ab + b,

we need to show that b ∗ a = a
In mathematics, a binary operation on a + ab + b. Here, b ∗ a = b + ba
set is a calculation that combines two + a. But we all know that if a
elements of the set (called operands) to and b is an element of R, a + b
produce another element of the set. = b + a and ab = ba. So b ∗ a
= a + ab + b.
Let G be a non-empty set. An - Now, we could say that operation *
operation * on G is said to be a binary is commutative.
operation on G if for every pair of Example 2. Consider the binary operation *
elements, a, b is in G that is a,b ∈ G; on R given by a*b = a + ab + b. Tell whether
the product a * b ∈ G. it is commutative or associative.
Note: For each (a,b) ∈G, we assign an Solution: ii. For associative
element a * b of G. ● We need to show that (a*b)*c =
a*(b*c). Working on the left member,
we have (a*b)*c = (a + ab + b) + (a *
COMMUTATIVE BINARY OPERATIONS b)c + c = (a + ab + b) + (a + ab + b)c
- A binary operation ∗ on a set A + c = a + ab + b + ac + abc + bc + c.
is said to be commutative if x ∗ Now, working on the right member,
y = y ∗ x for all elements x and we have a*(b*c) = a + a(b*c) + (b*c)
y of A. = a + a(b + bc + c) + (b + bc + c = a
+ ab + abc + ac + b + bc + c. Since
1. Is a * b = a + ab + ab commutative a*b)*c = a*(b*c), hence the operation
for all a, b ∈ R? * is associative.
2. Consider the binary operation * on
Q, the set of rational numbers, defined Identity Element and Inverse in Binary
by a * b = a2+b2 ∀ a, b ∈ Q. Operation
Determine whether * is commutative.
3. Consider the binary operation * on ➢ Let * be a binary operation of a set
N, the set of natural numbers, defined S.
by a * b = a - b ∀ a, b ∈ N. Determine I. An element e ∈ S is called a left
whether * is commutative. identity element if for all a ∈ S,
we have e * a = a
ASSOCIATIVE BINARY OPERATIONS II. An element e ∈ S is called a
- A binary operation ∗ on a set A right identity element if for all a
is said to be associative if (x ∗ ∈ S, we have a * e = a
y) ∗ z = x ∗ (y ∗ z) for all III. An element e ∈ S is called an
elements x, y and z of A. identity element if for all a ∈ S,
we have a * e = a and e * a = a.
Example 2. Consider the binary operation *
on R given by a*b = a + ab + b. Tell whether ➢ Let “e” be the identity element
it is commutative or associative. is S and a ∈ S, then b is called
Solution: i. For commutative an inverse of the element “a” if
a * b = e and b * a = e.

Made with love by Karylle ;]

 REVIEWER FOR MMW

Note that a * b = b * a = e.
➢ If a ∈ S, then the inverse of “a”
is denoted by a-1. Here -1 is not
an exponent of a.
★ A set is “closed” under operation if
the operation assigns to every
ordered pair of elements from the
set an element of the set.
★ A set R is said to be closed with
respect to a binary operation *
if for any two elements a, b ∈ R,
a * b produces an element
which belongs to R. That is, a *
b ∈ R for all a, b ∈ R.

CAYLEY’S TABLE
- A (binary) operation on a finite set
can be represented by a table. This
is a square grid with one row and
one column for each element in the
set. The grid is filled in so that the
element in the row belonging to x
and the column belonging to y is x*y.
- A binary operation on a finite set (a
set with a limited number of
elements) is often displayed in a
table that demonstrates how the
operation is performed.

Made with love by Karylle ;]