Group 2 Discreteedited2

Proof by Contradiction
REPORTER: SOPHIA MARIE H. ORIAS

PROOF BY CONTRADICTION
Also know as Indirect Proof or the method of

reductio ad absurdum meaning disaproving
someones argument using logical conclusion.
In Mathematics and Logic, proof by contradiction is

a form of proof that establishes the truth or the
validity of a proposition by assuming that the
proposition is false that can lead to a contradiction.
RELATIONSHIP WITH OTHER PROOF TECHNIQUES
• proof by contradiction is closely related to proof by

contrapositive, and the two are sometimes
confused with each other, though they’re distinct
methods. The main distinction is that a proof by
contrapositive applies only to the statements P that
can be written in the form A→B, whereas the
technique of proof by contradiction applies to the
statements P of any form.
RELATIONSHIP WITH OTHER PROOF TECHNIQUES
• Proof by contradiction : assume ~P and derived a contradiction.

• in the case where the statement to be proven is an implication
A→B, then the differences between direct proof, proof by
contrapositive and proof of contradiction can be outlined as
follows:
> Direct Proof : assume A and show B.
> Proof by contrapositive: assume ~B and show ~A.
this corresponds to the equivalence
A→B = ~B→~A.
> Proof by Contradiction : assume A and ~B
BASIC PROCESS DESCRIBNG THE APPROACH OF PROOF
BY CONTRADICTION
1. State that the original statement is false.
2. Assume the negation of the original statement is true.
3. Prove the assumption as usual using other proof
techniques such as direct and contrapositive proof.
4. Expect a contradiction while you prove the assumption.
5. Declare the assumption to be false when you find a
contradiction.
6. Since the assumption is false, state that the original
statement must be true.
EXAMPLE:
• Prove : 2 is irrational
Assume 2 is rational. then there exists 2 integers, a and
b, 2
such that = a/b, b≠0 and a and b have no common
factors.
a
2
b
a must be even.
2
a
2  2
b
2b 2
 a 2
EXAMPLE:
• since a is even, a = 2c for some integer c. thus,

2b 2  (2c)2
2b 2  4c 2
b 2  2c 2 b must be even.
since a and b have a common factor, this contradict

our original assumption.
Direct Proofs
REPORTER: RANS SALUAGUE
Direct Proof
INTRODUCTION
A DIRECT PROOF IS ONE OF THE MOST FAMILIAR FORMS OF
PROOF. WE USE IT TO PROVE STATEMENTS OF THE
FORM ”IF P THEN Q” OR ”P IMPLIES Q” WHICH WE CAN
WRITE AS P ⇒ Q. THE METHOD OF THE PROOF IS TO
TAKES AN ORIGINAL STATEMENT P, WHICH WE ASSUME TO
BE TRUE, AND USE IT TO SHOW DIRECTLY THAT ANOTHER
STATEMENT Q IS TRUE. SO A DIRECT PROOF HAS THE
FOLLOWING STEPS:

• Assume the statement p is true.

• Use what we know about p and other facts as necessary to

deduce that another statement q
is true, that is show p ⇒ q is true.
Example
Directly prove that if n is an odd integer then
is also an odd integer.

Solution
Let p be the statement that n is an odd integer and q be the statement that is an odd
integer.
Assume that n is an odd integer, then by definition n = 2k + 1 for some integer k.
We will now use this to show that is also an odd integer.
2 = (2k + 1)^2 since n = k + 1

= (2k + 1)(2k + 1)
= 4k^2 + 2k + 2k + 1 by expanding the brackets
= 4k^2 + 4k + 1
= 2(2k^2 + 2k) + 1 since 2 is a common factor.
Hence we have shown that n
2 has the form of an odd integer since 2k
2 +2k is an integer. Therefore
we have shown that p ⇒ q and so we have

completed our proof.
References:
Summary:
Direct Proof
Direct proof of P(x) = Q(x) for all x E D:
 Assume that P(x) is true for an arbitrary x E D,

 and show that Q(x) is true for this x.
Properties of integers: In order to illustrate this type of proof we need to know the
following:
 The negative of an integer is an integer.
 The sum (and difference) of two integers is an integer.
 The product of two integers is an integer.
 An integer n is even if n = 2k for some integer k.
 An integer n is odd if n = 2k + 1 for some integer k.

DIVISIBILITY
REPORTER: HANNAH JOY ADO
DIVISIBLE
A number aa is divisible by the
number bb if a÷ba÷b has a remainder of
zero (00). For example, 15 divided by 3 is
exactly 5 which implies that its
remainder is zero. We then say that 15 is
divisible by 3.
In our other lesson, we discussed the
divisibility rules for 7, 11, and 12. This time,
we will cover the divisibility rules or tests for
2, 3, 4, 5, 6, 9, and 10. Believe me, you will be
able to learn them very quickly because you
may not know that you already have a basic
and intuitive understanding of it.
For instance, it is obvious that all even
numbers are divisible by 2. That is pretty
much the divisibility rule for 2. The goal
of this divisibility rules lesson is to
formalize what you already know.
Divisibility rules help us to determine if a number is
divisible by another without going through the actual
division process such as the long division method. If
the numbers in question are numerically small enough,
we may not need to use the rules to test for divisibility.
However, for numbers whose values are large enough,
we want to have some rules to serve as “shortcuts” to
help us figure out if they are indeed divisible by each
other.
Example 1: Is the number
246 divisible by 2?
Solution: Since the last

digit of the number 246
ends in 6, that means it is
divisible by 2.
Example 2: Are all the numbers 100, 514, 309, and
768 divisible by 2?
Solution: If we examine all four numbers, only

the number 309 doesn’t end with 0, 2, 4, 6, or 8.
We can conclude that all the numbers above
except 309 are divisible by 2..
Division
Algorithm
Kyle Coronel
Reporter
The division algorithm is an algorithm in which
given 2 i n t e g e r s A a n d B , it computes their
quotient Q and remainder R, where 0 < R.
REMAINDERS
a remainder is a quantity “left over”
after performing a particular algorithm.
The term is most common used to refer to
the number left over when two integers are
divided by each other in integer division.
Algorithm 3.2.2. Division for positive numbers.
I n p u t : a natural number A and a natural number B
O u t p u t : Two integers q and r such that a=(q⋅b)+r and 0≤r<b
1.i f a < b t h e n r e t u r n 0 , a
2.l e t q : = 0
3.l e t r : = a
4.r e p e a t
a.let q:=q+1
b.let r:=r−b
5.u n t i l r < b
6.r e t u r n q , r
Example # 1 : Dividing 4 by 7 with
Algorithm
We f i n d t h e o u t p u t v a l u e s o f A l g o r i t h m f o r t h e i n p u t
values a=4 and b=7.
Input: a=4and b=7
1.As a=4 and b=7 statement a<b is true. So we follow the

instruction after then and return the values
of q and r namely 0 and 4.
Output: 0,4
Thus the quotient of the division of 4 by 7 is 0 and the

remainder is 4.
Example # 2 : Dividing 30 by 8 with
Algorithm
We f i n d t h e o u t p u t v a l u e s o f t h e A l g o r i t h m 3 . 2 . 2 f o r
the input values a=30and b=8.
Input: a=30 and b=8 As r=6and q=8 the statement r<q

is true. So we continue with
s t e p 6.
1. A s a = 3 0 a n d b = 8 t h e s t a t e m e n t a < b i s f a l s e .
We r e t u r n t h e q u o t i e n t q = 3 a n d
So we continue with step 2.
the remainder r=6
Output: 3, 6
2. let q:=0
3. let r:=30
4.a. let q:=0+1=1
4. b let r:=30−8=22
5. As r=22 and q=1the statement r<q is false.
So we continue with step 4
4.a. let q:=1+1=2
4.b let r:=22−8=14
As r=14and q=8 the statement r<q is false. So we continue

with step 4
4.a. let q:=1+2=3
4.b. let r:=14−8=6
Algorithm 3.2.10
Division for negative
integers
Input:
a negative integer A and a natural number B
Output:
Tw o i n t e g e r s q a n d r s u c h t h a t a = ( q ⋅ b )
+r and 0≤r<b
1.l e t q : = 0
2.l e t r : = a
3.r e p e a t
a. let q:=q−1
b. let r:=r+b
4.u n t i l r ≥ 0
5.r e t u r n q , r
a=−20 and b=7.
Input: a=−20 and b=7
As r=1 the statement r≥0
1. let q:=0
is false. So we continue
2. let r:=a=−20
with step 5.
3.a. let q:=0−1=−1
3.b. let r:=−20+7=−13
5 . We r e t u r n t h e q u o t i e n t

q=−3 and the remainder r=1
As r=−20the statement r≥0 is false. So we
Output: −3,1
continue with step 3.
3.a. let q:=−1−1=−2
3.b. let r:=−13+7=−6
4. As r=−6 the statement r≥0 is false. So we
continue with step 3.
3.a. let q:=−2−1=−3
3.b. let r:=−6+7=1
GREATEST COMMON
DIVISORS
REPORTER: MARIO GRIEFIEL
GCF/GCD - Greatest Common
Factor/Divisor
A number you can use to divide into a
certain number and what you get is a
whole number
TRADITIONAL
METHOD
12 = (1, 2, 3,4, 6, 12)
36 = (1, 2, 3, 4, 6, 9, 12, 18, 36)
Greatest Common Divisor= 12
OTHER METHOD
WHAT IS THE COMMON DIVISOR OF 192
AND 168?
192÷2=96 168÷2=84
96=2=48 84÷2=42
48÷2=24 42÷2=21
24÷2=12 21÷3=7
12÷2=6
2x2x2x3=24
6÷3=2
Greatest common divisor
And
Linear Combination
REPORTER: ARLYN VINLUAN
Greatest common divisor
The greatest common divisor is sometimes
called the greatest common factor or
highest common factor. The greatest
common divisor of two integers (not both
zero) is the largest integer which divides
both of them.
Linear Combination
Is an expression constructed from a
set of terms by multiplying each term
by a constant and adding the results.
WHEN DOES GCD(a,b)=ax + by?
The greatest common divisor as a linear combination of
two values that is gcd (a,b) = xa + yb
Assume that a,b,x and y are integers (positive, negative
or zero )
All of the values of ax + by, are multiples of gcd(a,b)
The smallest possible positive value for ax + by is
gcf(a,b)
Here are some examples:
For example, the greatest common divisor

of 52 and 44 is 4. And, sure enough, 4 is a
linear combination of 52 and 44:
52=(1)44 + 8
44=(5)8 + 4
8= (2)4 + 0
Here are some examples:
Express gcd(84,199) as a linear
combination of 84 and 119.
Checking:
119=(1)84 + 35 119-(1)84gcd(84,119)=7
84=(2)35 + 14 84-(2)35 =35-(2)14
35=(2)14 + 7 35-(2)14 =(1)35 + (-2)14
14=(2)7 + 0 =(1)35 + (-2)[84-(2)35]
=(5)35 + (-2)84
=(5)[119-(1)84] + (-2)84
=(5)119 + (-7)84
Be’zout Coefficient
Use the Euclidean Algorithm to find integers x and y so that
22x+60y=gcf(22,60)
Step1: Step 2 Substitute a=22 and b=60: Step 3 Solve for the remainder in terms of a
and b and substitute into subsequent equation
60=22(2)+16 b=a(2)+16 b=a(2)+16b-2a=16
22=16(1) + 6 a=16(1) + 6 a=16(1) + 6 a=(b-2a)(1) + 6
16= 6 (2) + 4 16= 6 (2) + 4 a=b-2a+6
6= 4(1) + 2 a+2a-b=6
6= 4(1) + 2 3a-b=6
4=2(2)+ 0 So gcf (a,b) =2 16= 6 (2) + 4 b-2a=(3a-b)(2) + 4
b-2a=6a-2b +4
So gcf (22,60) =2 b+2b -2a-6a=4
3b-8a = 4 cv
6= 4(1) + 2 3a-b = 3b-8a(1) + 2
3a-b = 3b-8a + 2
Therefore x=11, y=-4 is a solution to 3a-b-3b+8a = 2
22x + 60y = gcf(22,60) 11a-4b = 2 cv

Group 2 Discreteedited2

Uploaded by

Copyright:

Available Formats

Group 2 Discreteedited2

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Group 2 Discreteedited2

Uploaded by

Copyright:

Available Formats

Proof by Contradiction

REPORTER: SOPHIA MARIE H. ORIAS

Also know as Indirect Proof or the method of

In Mathematics and Logic, proof by contradiction is

• proof by contradiction is closely related to proof by

• Proof by contradiction : assume ~P and derived a contradiction.

• since a is even, a = 2c for some integer c. thus,

since a and b have a common factor, this contradict

• Use what we know about p and other facts as necessary to

2 = (2k + 1)^2 since n = k + 1

2 has the form of an odd integer since 2k

2 +2k is an integer. Therefore

we have shown that p ⇒ q and so we have

Direct proof of P(x) = Q(x) for all x E D:

 Assume that P(x) is true for an arbitrary x E D,

 The negative of an integer is an integer.

 The sum (and difference) of two integers is an integer.

 The product of two integers is an integer.

 An integer n is even if n = 2k for some integer k.

 An integer n is odd if n = 2k + 1 for some integer k.

Solution: Since the last

Solution: If we examine all four numbers, only

1.As a=4 and b=7 statement a<b is true. So we follow the

Thus the quotient of the division of 4 by 7 is 0 and the

Input: a=30 and b=8 As r=6and q=8 the statement r<q

As r=14and q=8 the statement r<q is false. So we continue

For example, the greatest common divisor

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.