Lesson 7
Lesson 7
OPERATION
MS. DIVINA ESTACIO, MSM, LPT
ASSISTANT PROFESSOR 4
In mathematics, a binary operation
on a set is a calculation that
combines two elements of the set
(called operands) to produce
another element of the set.
A binary operation on a set G, then, is
simply a method (or formula) by which
the members of an ordered pair from G
combine to yield a new member of G.
This condition is called closure.
The most familiar binary operations
are ordinary addition, subtraction, and
multiplication of integers.
The division of integers is not a binary operation on the integers
because an integer divided by an integer need not be an integer.
1) G∈Z define a * b = a + b (usual addition on Z)
2) G∈Z define a * b = ab (usual multiplication on Z)
3) G∈R+ defined by a * b = a + 17b
4) G∈Z+, defined * by a * b = a – b for all set a, b
∈Z+
5) G∈R defined by a * b = ab
6) G∈Z \{-1} , defined * by a * b = a + b + ab for all
set a, b ∈ Z.
Learning Outcome:
1. State different types of reasoning to justify statements and arguments made
about mathematics and mathematical concepts.
2. Write clear and logical proofs.
3. Solve problems involving patterns and recreational problemsfollowing Polya’s
four steps.
4. Organize one’s methods and approaches for proving and
solving problems.
A. Intuition - immediate understanding
or knowing something without reasoning.
- comes from noticing, thinking , and
questioning
As a student, you can build and improve your intuition by
doing the following:
Ponzo illusion
(1911)
B. By definition, a proof is an inferential
argument for a mathematical statement
while proofs are an example of
mathematical logical certainty.
ILLUSTRATION 1: Prove (in outline form) that “if
x is a number with 5x + 3 = 33,then x = 6”
ILLUSTRATION 2: Prove (in
paragraph form) that “if x is a number
with 5x + 3 = 33, then x = 6”
TRY With the use of direct proving,
prove the following in outline and
paragraph form.
Prove:
If x and y are two odd integers, then
the product of x and y is also an odd
integer.
TRY
Prove the proposition (in outline form
and paragraph form) that is “ if x is a
𝟐
positive integer, then 𝒙 is also an odd
integer”.
Direction: prove the following
propositions with the use of direct
proving.
(5 marks each)
!
1. If a is an odd integer, then 𝑎 + 3𝑎 +
5 is odd.
" "
2. Suppose x, y ∈ Z. if 𝑥 and 𝑦 are odd,
"
then (𝑥𝑦) is odd.
3. suppose x, y ∈ Z. if x is even, then xy
is even.
! !
4. If n – m is even, then 𝑛 – 𝑚 is
also even.
5. If x is odd positive integer then
!
𝑥 – 1 is divisible by 4.
6. If x is an odd integer, then 8 is a
!
factor of 𝑥 – 1.
Example 1. Using indirect/contrapositive proof,
prove that “If x is divisible
by 6, then x is divisible by 3”.
Proof:
1. Assume x is not divisible by 3.
2. Then x ∈ 3k for all k ∈ Z
3. It follows that x ∈(2m)(3) for all m ∈ Z
4. So, x ∈ 6m for all m ∈ Z
5. Therefore, x is not divisible by 6.
Example 2: Prove using indirect proof or
contraposition.
Proof:
1. Assume x is odd.
2. Then x = 2k + 1 for some k ∈ Z
! ! !
3. It follows that 𝑥 =(2𝑘 + 1) = 4𝑘 + 4k +
!
1 = 2(2𝑘 + 2k) + 1
!
where q = 2𝑘 + 2k
!
4. So, 𝑥 = 2q + 1
!
5. Therefore, 𝑥 is odd.
Direction: Prove the following propositions with
the use of indirect proving.
1. If a is an even integer and b is an odd integer,
then a + b is an odd integer.
! "
2. If n is an odd integer, then 𝑛 + 2𝑛 is also an
odd integer.
" "
3. If n – m is even, then 𝑛 – 𝑚 is also an even.
4. If x is odd positive integer then 𝑥 " – 1 is
divisible by 4.
"
5. If x is an odd integer, then 8 is a factor of 𝑥 – 1.
6. Suppose x, y ∈ Z. If x is even, then xy is even.
3. Proof by counterexample
(disproving universal statements)
Example 1. Prove or disprove: all prime numbers are odd.
*Negation: some prime numbers are even.