Professional Documents
Culture Documents
MODULE-9-math-reasoning-copy
MODULE-9-math-reasoning-copy
REASONINGS
Module 9
Overview
EXAMPLE(S)
2. Every crow I have seen is black. Therefore, all crows are black.
3. House prices are very expensive in Davao City. Gases prices are very
expensive in Davao City. Food prices are very expensive in Davao City.
Therefore, it is very expensive to live in Davao City.
DEDUCTIVE REASONING
EXAMPLE(S)
2. If , then .
3. Driving under the influence of alcohol is illegal and punishable by
law. Therefore, if a driver is found to have a blood alcohol
concentration above the legal limit during a traffic stop, they are likely
to be charged with driving under the influence.
INTERACTION:
Hypothetical
_________ Simplification _________ syllogism
p
q ~p Disjunctive
Conjunction
_________ _________ syllogism
p Modus ponens
_________
(the mode of
affirming)
Examples
EXAMPLE
• 14 is even, because , and 7 is an integer.
• is even, because , and -5 is an integer.
DEFINITION: ODD NUMBER
EXAMPLE
• 13 is odd, because , and 6 is an integer.
• is even, because , and -6 is an integer.
Method of Proof Description
When dealing the statement “If P(x) then Q(x)” over a domain
S, there is some connection between P(x) and Q(x). That is,
the truth value of Q(x) for a particular often depends on the
truth value of for that same element , or the truth value of
P(x) depends on the truth value of Q(x). These are the kinds
of implications in which we are primarily interested and it is
the proofs of these types of results
DIRECT PROOF
A direct proof starts from the hypothesis and arrives to the conclusion
using only straightforward deductions.
Start with the Hypothesis: Begin with a statement or proposition that
you assume to be true (often called the hypothesis or premise).
Logical Deductions: Use logical reasoning, known facts, definitions,
and previously established theorems to derive new statements or
conclusions.
Arrive at the Conclusion: The sequence of logical deductions should
lead you directly to the statement you want to prove (the conclusion).
EXAMPLE
Proof:
Suppose is odd. Then, by definition of odd numbers, for some integer .
Give a direct proof of the statement, “If n is odd, then is an even integer.”
Proof:
Suppose is odd. Then, by definition of odd numbers, for some integer .
I. Verification
If n = 1, verify if P(1) is true.
3=3
Examples
6=6
II. Hypothesis of Induction
Assume that the statement is true for n = k, that is, P(k) is true.
1 + 2 + 3+ … + k = (eq. 1)
Examples
= + (k + 1)
=
Examples
III. Conclusion
Since the statement is true for n = k + 1, then it must
be true for all higher natural number.