MODULE 1: PATTERNS AND NUMBERS IN Try dividing a fractal pattern into

NATURE smaller parts, and will notice that

we almost have the same reduced
SYMMETRY
copy of the same figure.
Mirror Symmetry
➔ composed of shapes that repeat
➔ Mirror symmetry uses the concept
over and over again.
of reflection.
Rotational symmetry
SIERPINSKI TRIANGLE
➔ Figures possessing rotational
➔ The Sierpinski triangle is a fractal
symmetry are alike on all sides.
described in 1915 by Waclaw
Sierpinski. Its structure possesses
WAVES
what we call “self-similar”. Do the
➔
same process all over again, and
one will see that any smaller piece
BUBBLES AND FOAMS
will look identical to the whole
➔ The soap bubbles are actually
figure. The shape that is formed is
forming a two-dimensional figure
called the Sierpinski gasket.
called a sphere. In simpler terms,
the figure formed by the foam and
the bubbles looks like tiny little
circles. Though sometimes, the
circle-like figure varies in size, it
resembles that of a ball.

FRACTALS
➔ A fractal is a pattern that the laws
of nature repeat at different scales.
➔ A property called self-similarity
makes the study of fractals even
more interesting.
➔ Fractals are beautiful structures
produced by nature. (Rose, 2012).
Lesson 2. The Fibonacci Sequence ➔ Binet’s formula
and the Golden Ratio named after the mathematician
Jacques Philippe Marie Binet. It is
FIBONACCI SEQUENCE used to find the nth term of the
➔ The number sequence is known as Fibonacci sequence.
the Fibonacci sequence. The
Fibonacci is named after the
mathematician Leonardo
Fibonacci who stumbled across it
in the 12th century.
➔ The three dots after 89 is called an ➔ Golden mean/ golden ratio
ellipsis which means the pattern a golden ratio (sometimes called
continues without end. the divine proportion is an
➔ The idea behind the sequence is irrational number that possesses
just to add the previous 2 numbers unusual properties. The ratio is 1
to get the next number. Though to 1.618 (or 1.6180339…).
listing the first 100 terms can be
very lengthy, the point is it can be
done using paper and pen.
➔ 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,
89, …
➔ Example in nature: orchids, in ➔ That particular value the ratio
sunflower, in lilies, and in various seemed to settle down is
plants approximately 1.618034. We call
➔ Recurrence relation this number the golden mean or
the golden ratio often denoted by
φ (Phi).

➔ Example:
“Sunflowers, which have opposing
spirals of seeds, have a 1.618 ratio
between the diameters of each MODULE 2: Mathematics Language
rotation. This same ratio can be and Symbols
seen in relationships between
different components throughout Lesson 1: THE LANGUAGE OF
nature.” MATHEMATICS

Characteristics of Mathematical
Language
Precise
➔ able to make very fine distinctions.
This characteristic is particularly
exercised when mathematicians
define a term. This is done so in a
precise way that only what is
necessary is included in the
definition. This way no confusions
will arise. For instance, one can
distinguish a triangle from a
square.

Concise
➔ able to say things briefly. Instead
of always saying a number larger
than 5, mathematics tells us that
we can write the text as x + 5 by
making x represent any number.
The conciseness of the
mathematical language can be
seen in its wide usage of symbols.
Powerful ➔ it contains an expression and a
➔ able to express complex thoughts verb. (equal sign “=”, inequality
with relative ease This is symbol “<, >, ≤ and ≥”)
particularly seen in advanced ➔ a mathematical sentence states a
mathematics where mathematical complete thought, it makes sense
arguments are always expressed to ask whether it is true, false, or
in its equivalent symbolic form for sometimes true/sometimes false.
the purpose of proving statements. ➔ For instance, in the mathematical
This is done when mathematicians sentence
are at their most formal . However,
we can also see how this
characteristic is used when we
look into definitions, theorems,
axioms, etc.

EXPRESSION VS. SENTENCE

Expression (noun)
➔ an expression is the mathematical
object of interest.
➔ does not state a complete thought,
so it does not make sense to ask if
an expression is true or false.
➔ The most common types of an
expression are numbers, sets,
and functions.

Sentence
➔ A mathematical sentence is a
correct arrangement of
mathematical symbols that states
a complete thought.
Lesson 2: Conventions in the Three Methods to describe sets
Mathematical Language ● Word description
➔ The set of months of the
SETS year beginning with letter M.
➔ A group or a collection of objects is ● Rooster Method
called a set. ➔ In this method, we list down
all the elements of the set,
separate each element by a
comma, and enclose the
➔ It has to be well-defined. whole list within set
➔ A set is formed by collecting brackets { }.
objects based on a rule. This rule ➔ A = {March, May}
must be precise so one can easily ➔ “A is the set whose
distinguish whether an object elements are March and
belongs to a set or not. May”
● Set-builder notation
Sets part 2 ➔ In this method, it is
➔ Symbol (∈) indicates set important that we describe
membership and (∉), otherwise. the set using the properties
➔ Use an upper-case letter to satisfied by its elements,
represent a set. and only by its elements.
➔ Example: “hello” ➔ The symbol | is read as
h∈H e∈H l∈H “such that”
o∈H ➔ A = {x|x is a month of the
Read as “h is an element of set H” year beginning with letter
a∉H M}
Read as “a is not an element of H” ➔ “A is the set of all objects x
such that x is a month of the
year beginning with letter
M.”
Sets part 3
➔ 1 is a natural number.
1∈ℕ
“1 is an element of the set of
natural numbers.”
➔ 3 is a prime number.
3∈𝑃
“3 is an element of the set of prime
numbers.”
➔ The set of natural numbers less
than 10.
Rooster Method:
{1,2,3,4,5,6,7,8,9}
Set-builder Notation:
{x|x ∈ ℕ and x < 10}
➔ The set of real numbers greater
than 6 but less than or equal to 15.
Rooster Method:
{7,8,9,10,11,12,13,14,15}}
Set-builder Notation:
{x|x ∈ ℝ and x 6 < 𝕫 ≤ 15}
Lesson 3: Some Elementary Logic
Statements
➔ is a declarative sentence that is
either true or false, but cannot be
both at the same time.
➔ Truth value of the statement (true
or false)
➔ Example:
21 + 10 = 45 - statement (false)
x ≥ 0 - not a statement (neither
true nor false)
A logic statement can be composed of
one or more simple statements.
Simple Statements
➔ is a statement that expresses a
single idea.
➔ George Boole introduced the use
of letters such as p,q,r, and s to
represent simple statements.
Compound Statements
➔ Can be formed by joining
statements p and q using one or
more logical connectives: ∧ (and),
∨ (or), ⇒ (implies, and ⇔ (if and
only if).
Conjunction Conditional
➔ When we join 2 or more ➔ When we join 2 or more
statements using “and” (∧) statements using connective
➔ Only true when p and q are both “implies” (⇒)
true. ➔ p is referred to as the hypothesis
➔ Truth value of conjunction: while q is the conclusion.

p q p∧q ➔ Only false when only p is true and

q is false.
true true true
➔ Truth value of conjunction:
true false false
p q p⇒q
false true false
true true true
false false false
true false false

Disjunction false true true

➔ When we join 2 or more false false true

statements using “or” (∨)
➔ Only false when p and q are both Biconditional
false ➔ When we join 2 or more
➔ Truth value of conjunction: statements using connective “if

p q p∨q and only if” (⇔)

➔ Only true when p and q have the
true true true
same truth value (both are true
true false true and both are false)
false true true ➔ Truth value of conjunction:
false false false p q p⇔q

true true true

true false false

false true false

false false true

Negation
➔ Negation of a statement p is to
take its opposite by using the word
“not”, at least in most cases.
➔ Example:
p: 13 is an even number
∼ p: 13 is not an even number.
∼ p: 13 is an odd number.
➔ ∼ p is true if and only if p is
false.

Quantifiers
➔ All, each, every, some, no, and
none.
➔ Quantified statement
a statement that uses a quantifier.

Existential Quantifiers
➔ for some, there exists, and at least
one
➔ Existential statement
a statement that uses an
existential quantifier.

Universal Quantifiers
➔ no, none, all, and every
➔ Universal statements
statements with universal
quantifiers.