Professional Documents
Culture Documents
GEMATMW:
Mathematics in the
Modern World
Von Anthony G. Torio, Ph.D.
von.torio@dlsu.edu.ph
Course Topics
Module # Topics
1 Mathematics as a Language
Course Topics
Module # Topics
6 Mathematics in Finance
Mathematics as a
Language
Essential Questions
1. How can I view Mathematics as a
fundamental tool applicable to a wide range
of disciplines?
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y.
2022-2023 De La Salle University
Taft Avenue, Manila
Course Tasks
Collaborative Task
Adjusted Due: September 20,
2023
@11:59 pm
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y.
2022-2023 De La Salle University
Taft Avenue, Manila
Course Tasks
Individual Work
Course Tasks
Individual Work
Mathematics as a
Language
Topics:
GEMATMW: Mathematics in the Modern World/ DLSU - Manila Photo by Christopher Sardegna on unsplash.com
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Mathematical
Reasoning
★Refers to the ability of a
person to analyse problem
situations and construct logical
arguments to create both
conceptual foundations and
connections to be able to
process the available
information and solve the
problems.
Inductive vs Deductive
★Inductive reasoning -
process of making general
conclusions based on specific
examples. Example:
Every object I release falls to
the ground. Therefore, the next
object I will release will fall to
the ground.
ISG - Inductive (Specific to General)
DGS - Deductive (General to Specific)
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Inductive vs Deductive
★Deductive reasoning -
process of making specific
conclusions based on general
principles. Example:
All men are mortal. I am a
man. Therefore, I am mortal.
General Principle: If p implies q
and q holds, then q must follow.
ISG - Inductive (Specific to General)
DGS - Deductive (General to Specific)
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Definitions
★A theorem is a statement that can be shown to be true.
★It is formulated by using a sequence of statements that form an
argument, called proof.
★The statements used in a proof may include axioms - underlying
assumptions about mathematical structures, the hypothesis of the
theorem (scientific guess), and previously proven theorems.
★ The rules of inference tie together the steps of a proof.
Rules of
Inference
Rules of
Inference
Addition
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Rules of
Inference
Simplification
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Rules of
Inference
Conjunction
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Rules of
Inference
Modus ponens
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Rules of
Inference
Modus tollens
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Rules of
Inference
Hypothetical syllogism
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Rules of
Inference
Deductive syllogism
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Examples
Example 1
Example 1
Analysis
Example 1
Example 1
Example 1
Rules of
Inference
Example 1
Example 2
Example 2
Analysis
Example 2
Anna is a human
resource management
major. Therefore,
Anna is either a
human resource
management major or
a computer
applications major.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 2
Anna is a human
resource management
major. Therefore,
Anna is either a
human resource
management major or
a computer
applications major.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 2
Anna is a human
resource management
major. Therefore,
Anna is either a
human resource
management major or
a computer
applications major.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Rules of
Inference
Example 2
Answer: Addition
Example 3
Example 3
Analysis
Example 3
Ben is a game
designer and a
game developer.
Therefore, Ben is a
game designer.
Example 3
Ben is a game
designer and a
game developer.
Therefore, Ben is a
game designer.
Example 3
Ben is a game
designer and a
game developer.
Therefore, Ben is a
game designer.
Rules of
Inference
Example 3
Answer: Simplification
Example 4
Example 4
Analysis
Example 4
Example 4
Example 4
Rules of
Inference
Example 4
Example 5
Example 5
Analysis
Example 5
Example 5
Example 5
Rules of
Inference
Example 5
Example 6
Example 6
Analysis
Example 6
If I go swimming,
then I will stay in the
sun too long. If I
stay in the sun too
long, then I will get
burned. Therefore, if
I go swimming, then
I will get burned.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 6
If I go swimming,
then I will stay in the
sun too long. If I
stay in the sun too
long, then I will get
burned. Therefore, if
I go swimming, then
I will get burned.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 6
If I go swimming,
then I will stay in the
sun too long. If I
stay in the sun too
long, then I will get
burned. Therefore, if
I go swimming, then
I will get burned.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Rules of
Inference
Example 6
Example 7
Example 7
Analysis
Example 7
Example 7
Example 7
Rules of
Inference
Example 7
Answer: Conjunction
Fallacies
Fallacies
★Arguments constructed using the rules of inference are said to be
valid.
★When all propositions used in a valid argument are true, it leads to
a correct conclusion.
★Fallacies are incorrect reasoning which appear to follow the rules of
inference but are based on contingencies rather than tautologies.
Tautology
Contradiction
Contingency
Example 1
Example 1
Analysis
Example 1
If you do every
problem in a math
book, then you will
learn Mathematics. You
learned Mathematics.
Therefore, you did
every problem in the
book.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 1
If you do every
problem in a math
book, then you will
learn Mathematics. You
learned Mathematics.
Therefore, you did
every problem in the
book.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 1
If you do every
problem in a math
book, then you will
learn Mathematics. You
learned Mathematics.
Therefore, you did
every problem in the
book.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Alternatively…
Example 1
If you do every
problem in a math
book, then you will
learn Mathematics. You
learned Mathematics.
Therefore, you did
every problem in the
book.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 1
Example 2
Example 2
Analysis
Example 2
If you do every
problem in a Math
book, then you will
learn Mathematics.
You did not do every
problem in the book.
Therefore, you did not
learn Mathematics.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
`
If you do every
problem in a Math
book, then you will
learn Mathematics.
You did not do every
problem in the book.
Therefore, you did not
learn Mathematics.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 2
If you do every
problem in a Math
book, then you will
learn Mathematics.
You did not do every
problem in the book.
Therefore, you did not
learn Mathematics.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Alternatively…
Example 2
If you do every
problem in a math
book, then you will
learn Mathematics. You
learned Mathematics.
Therefore, you did
every problem in the
book.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 2
Example 3
Example 3
Consider proving the statement: “If n is
even, then n is
2
even,” is the following argument valid?
Suppose that n =
2k for some integer k. Let n = 2l for
2
some integer l. This shows that n is even.
Analysis
Example 3
Consider proving the
statement: “If n is even,
2
This is a circular
then n is even,” is the
following argument valid? argument (same as
Suppose that even. n is
2 the proposition
Then n = 2k for some
2
integer k. Let n = 2l for being proved).
some integer l. This
shows that n is even.
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 3
Consider proving the statement: “If even, then n isn is
2
even,” is the following argument valid?
Suppose that even. Then n is
2 n =
2k for some integer k. Let
2
n = 2l for some integer l. This shows that n is even.
Methods of Proof
Methods of Proof
Methods of Proof
Methods of Proof
Methods of Proof
p q p q
T T T
T F F
F T T
F F T
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Vacuous Proof
Methods of Proof
p q p q
T T T
T F F
F T T
F F T
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 1
Vacuous Proof
Vacuous Proof:
Note:
P(0) is “If 0 > 1, then 02 > 0.”
p is false!
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Vacuous Proof:
Note:
P(0) is “If 0 > 1, then 02 > 0.”
Trivial Proof
Methods of Proof
p q p q
T T T
T F F
F T T
F F T
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 2
Trivial Proof
Direct Proof
Rules of
Inference
p q p q
T T T
T F F
F T T
F F T
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 3
Direct Proof
Direct Proof:
Suppose n is odd. Then, n = 2k + 1 for some integer k.
Direct Proof:
Suppose n is odd. Then, n = 2k + 1 for some integer k.
It follows that n = (2k + 1) = 4k + 4k + 1 = 2(2k + 2k) + 1.
2 2 2 2
Direct Proof:
Suppose n is odd. Then, n = 2k + 1 for some integer k.
It follows that n = (2k + 1) = 4k + 4k + 1 = 2(2k + 2k) + 1.
2 2 2 2
Indirect Proof
Rules of
Inference
p q p q
T T T
T F F
F T T
F F T
GEMATMW: Mathematics in the Modern World/ DLSU - Manila
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Example 4
Indirect Proof
Other Proofs
Methods of Proof
Methods of Proof
Methods of Proof
A proof of a proposition of the form:
Methods of Proof
Non-
existence One way is to assume that there is a
member of the universe of discourse for
proof which P(x) is true, and try to arrive at a
contradiction.
Methods of Proof
Example 5
Proof by contradiction
Proof by Contradiction
Proof by Contradiction
From this assumption, there exist integers a and b with
where a and b have no common factors (a/b is in lowest terms).
Proof by Contradiction
From this assumption, there exist integers a and b with
where a and b have no common factors (a/b is in lowest terms).
It follows that:
Proof by Contradiction
From this assumption, there exist integers a and b with
where a and b have no common factors (a/b is in lowest terms).
It follows that: This implies that a2 is even.
Proof by Contradiction
From this assumption, there exist integers a and b with
where a and b have no common factors (a/b is in lowest terms).
It follows that: This implies that a2 is even.
Furthermore, since a is even, a = 2c for
GEMATMW: Mathematics in the Modern World/ DLSU - Manila some integer c.
Von Anthony G. Torio, Ph.D.
Term 1, S.Y. 2023-2024 De La Salle University
Taft Avenue, Manila
Proof by Contradiction
From this assumption, there exist integers a and b with
where a and b have no common factors (a/b is in lowest terms).
It follows that: This implies that a2 is even.
Furthermore, since a is even, a = 2c for
some integer c.
Proof by Contradiction
From this assumption, there exist integers a and b with
where a and b have no common factors (a/b is in lowest terms).
It follows that: This implies that a2 is even.
Furthermore, since a is even, a = 2c for
some integer c.
Thus, 2b2 = 4c2, so that b2 = 2c2.
Proof by Contradiction
From this assumption, there exist integers a and b with
where a and b have no common factors (a/b is in lowest terms).
It follows that: This implies that a2 is even.
Furthermore, since a is even, a = 2c for
some integer c.
Thus, 2b2 = 4c2, so that b2 = 2c2.
Proof by Contradiction
From this assumption, there exist integers a and b with
where a and b have no common factors (a/b is in lowest terms).
It follows that: This implies that a2 is even.
Furthermore, since a is even, a = 2c for
some integer c.
Thus, 2b2 = 4c2, so that b2 = 2c2.
Example 6
Proof by Constructive Existence
Example 7
Proof by Mathematical Induction
P(1): The sum of the first 1 odd positive integers is 12. TRUE!
P(1): The sum of the first 1 odd positive integers is 12. TRUE!
Suppose P(n) is true for a positive integer n. That is:
GEMATMW: Mathematics in the Modern World/ DLSU - Manila 1 + 3 + 5 + … (2n - 1) = n2
Von Anthony G. Torio, Ph.D.
fi
Term 1, S.Y. 2023-2024
P(1): The sum of the first 1 odd positive integers is 12. TRUE!
Suppose P(n) is true for a positive integer n. That is:
1 + 3 + 5 + … (2n - 1) = n2
P(1): The sum of the first 1 odd positive integers is 12. TRUE!
Suppose P(n) is true for a positive integer n. That is:
1 + 3 + 5 + … (2n - 1) = n2
Assuming P(n) is true, it must be shown that P(n + 1) is true.
P(1): The sum of the first 1 odd positive integers is 12. TRUE!
Suppose P(n) is true for a positive integer n. That is:
1 + 3 + 5 + … (2n - 1) = n2
Assuming P(n) is true, it must be shown that P(n + 1) is true.
1 + 3 + 5 + … (2n - 1) + [2(n + 1)-1] = (n + 1)2
n2 + (2n + 1) = (n + 1)2
n2 + 2n + 1 = n2 + 2n + 1
P(1): The sum of the first 1 odd positive integers is 12. TRUE!
Suppose P(n) is true for a positive integer n. That is:
1 + 3 + 5 + … (2n - 1) = n2
Assuming P(n) is true, it must be shown that P(n + 1) is true.
n2 + 2n + 1 = n2 + 2n + 1
Since the two conditions of the mathematical induction are satisfied,
it can be concluded that P(n) is true for all positive integers n.
P(1): The sum of the first 1 odd positive integers is 12. TRUE!
Suppose P(n) is true for a positive integer n. That is:
1 + 3 + 5 + … (2n - 1) = n2
Assuming P(n) is true, it must be shown that P(n + 1) is true.
n2 + 2n + 1 = n2 + 2n + 1
Since the two conditions of the mathematical induction are satisfied,
it can be concluded that P(n) is true for all positive integers n.
That is, the sum of the first n odd positive integers is n.
2
Thank you!