Discrete Ppt4

Group members
Rashid 256
Jazil 66
Raffay 86
Today’s Topic:
 Contradiction
 Contrapositive
Contents:
 Proofs(Direct & Indirect)

 Definition (Contrapositive(indirect))
 Proof by Contradiction
 Examples (With Daily Life Usage)
 Methods
 Theorem
 Questions (Exercises Solved)
 Conclusion
Contradiction
 Definition :
In Discrete Structures, a contradiction refers to a compound statement that is false for all
possible combinations of truth values of the component statements that are part of it. In Other
Words, A Contradiction Is False In All Circumstances.
 Example :
P ~P P˄~P
T F F
F T F
Contradiction in Everyday Life:
 Examples:
 Saying "I can't speak English" in perfect English.
 Declaring "I will never lie again" right after lying.
 Declaring "I will never lie again" right after lying.
 if one statement asserts "It is raining," and another asserts "It is not raining,"
they form a contradiction because both cannot be true at the same time.
Proof by Contradiction(indirect):
In Mathematics Proof by contradiction is a technique
that determines the truth value of a
preposition/statement by showing that assuming the
preposition to be false.
A Proof by Contradiction is based on the fact that

either a statement is true or false but not both.
Hence the supposition, that the statement to be
proved is false, leads logically to a contradiction,
impossibility or absurdity, then the supposition must
be false.
Direct & Indirect Method
Proof by Contradiction:
 Explanation: It's like showing someone is wrong by assuming they are right
and then finding a mistake.
 Example: Proving that the square root of 2 (√2) is irrational by assuming it's
rational and finding a contradiction.
 Explanation: Instead of proving something directly, you prove its opposite
(contrapositive), which is logically equivalent.
 Example: Proving that if a number is not divisible by 3, then its square is not
divisible by 3 by assuming the square is divisible and showing it leads to the
original number being divisible.
Steps Involved in Contradiction
1. Assume that the statement to be
proved is false.
2. Show that our supposition is false.
3. In last step, we conclude that our

actual statement is true because our
supposition is false.
Theorem: Prove that There is no greatest integer.
Solution:
 Suppose there is a greatest integer N. i.e. n ≤ N Let M=N+1

 Now, M is an integer because it is sum of two integers
Also, M>N
 Hence our supposition is false that there is a greatest
integer.
 Therefore, it has been proved that there is no greatest
integer.
EXERCISE:
Give a proof by contradiction for the statement:
"If n² is an even integer then n is also an even
integer.“
Proof:
Suppose n² is even and n is not even, means n is odd.
If n is odd then :
Let n=2k+1
squaring both sides
n² = (2k+1)2
= 4k2+4k+1
= 2(2k2+2k)+1
let r= 2k2+2k
n² =2r+1 Then here n² becomes odd
but we have specify at the beginning that n² is even.
hence our supposition is false, So the statement is true.

Exercise:
Prove that √2+√3 is irrational.
Solution:
Let √2+√3 is rational
Then,
√2+√3= a/b
Squaring both sides.
2+3+2(√2)(√3) = a² / b²
5+2((√6)=
2(√6)= a² / b² -5
√6 = a² -5b²
2b²
Here √6 become rational but in actual it is not
rational, it is a contradiction. So the Theorem is
true that √2+√3 is a irrational.
Exercise:
Prove by contradiction method, the statement: If n and m are odd
integers, then n + m is an even integer.
Solution:
• In first step we suppose that n and m are odd and n + m is not even (odd
i.e. by taking contradiction).
• Now n = 2p + 1(General form of odd) for some integer p
m = 2q + 1 for some integer q
• Adding above two equation we get,
n + m = (2p + 1) + (2q + 1)
= 2p + 2q + 2 = → (General Odd's Form)
= 2. (p+q+1) Taking two common.
This is a contradiction to our supposition, because

when we multiply 2 with odd, we get even number.....
e.g. 2(7)=14
THEOREM:
The sum of any rational number and any irrational number
is irrational.
We suppose that there is a rational number r and an irrational number s

such that r + s is rational.
as r is a rational
So r =
r + s= c (2)
d
put r = in equation.. 2
a + s =c
b d
S= c - a
d b
S = bc-ad
bd
Here s is become rational but we have assumed that s is irrational. It is a
contradiction. So the theorem has been proved.
PROOF BY CONTRAPOSITIVE
What is CONTRAPOSITIVE?
The contra-positive of the conditional statement p → q is ~q->~p
A conditional and its contra-positive are equivalent.
Symbolically p →q ≡ ~q->~p
For example a contra-positive of a conditional statement is,

• If today is Friday, then 2 + 3 = 5. The contra-positive of the above statement will be,
•If 2 + 3 + 5, then today is not Friday.
We can see that these above two statement are logically equivalent
to each others.
STEPS INVOLVED PROOF BY CONTRAPOSITION
1. Express the statement in the form if p

then q.
2. Rewrite this statement in the contra-positive form,
if not q then not p
3. Prove the contra-positive by a direct proof.
EXERCISE:
Prove that if 3n + 2 is odd, then n is odd.
SOLUTON:
The contra-positive of the given conditional statement is,
"if n is even then 3n + 2 is even"
Lets us assume that n is even which means,
n=2k [By the definition of even]
Also 3n+2 is also even, so
3n+2= 3(2k)+2 [using the value of n]
= 6k + 2
= 2(3k+1)
= 2.r where r = (3k + 1) € Z
Hence 3n + 2 is even. We conclude that the given statement is
true since its contra-positive is true.
Comparing Contradiction and
Contrapositive
Contradiction with p -> q: Contrapositive with p -> q:
 Assume .p ∧∼ q.  Assume ∼q.
 Show any contradiction. The contradiction
may be ∼p or it may be ,q, or some other
 Show ∼p.
logical contradiction.  With contrapositive you assume
 Since you can reach any contradiction at less than contradiction, but you
all, it may be difficult to know what you know exactly what you are trying
are looking for. It also may be difficult to to show.
know if you’ve made an error.
 With contradiction you get to assume
more, but it is less clear what you want to
show
EXERCISE:
Prove that if n is an integer and n³ + 5 is odd, then n is even.
Solution:
•First we write the contra-positive of the statement, “
n is odd and n³ + 5 is even.“
Suppose n is an odd integer. Since, a product of two odd
integers is odd, therefore
n² = n.n is also odd.
then n³ = n2.n is also odd.
Further since the sum of two odd number is even,
For example,
9+3=12 (Which is even)
So,
n³ +5 will also be even.
Thus we have prove that if n is odd then n3 + 5 is even.
So our statement will also be true.
THE END

Discrete Ppt4

Uploaded by

Copyright:

Available Formats

Discrete Ppt4

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

Discrete Ppt4

Uploaded by

Copyright:

Available Formats

Group members

 Proofs(Direct & Indirect)

A Proof by Contradiction is based on the fact that

2. Show that our supposition is false.

3. In last step, we conclude that our

 Suppose there is a greatest integer N. i.e. n ≤ N Let M=N+1

but we have specify at the beginning that n² is even.

hence our supposition is false, So the statement is true.

This is a contradiction to our supposition, because

We suppose that there is a rational number r and an irrational number s

For example a contra-positive of a conditional statement is,

1. Express the statement in the form if p

You might also like

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