Lec 8
Lec 8
Lec 8
How to prove ?
where
odd 𝑂 (𝑛2 ) (Conclusion)
Indirect Proof for Proving
The validity of is proved by other indirect mechanisms
Proof by contrapositive
Vacuous proof
Proof by contradiction
Backward reasoning
¿ 2 (3 𝑘+ 1 )
where =
is even
Proving Vacuously
Based on the idea that is True if is False, irrespective of
over the set of integers: if > 1, then >
Is true ?
Proposition :
if > 1, then >
𝑇
𝐹 𝐹
The statement is vacuously true for
Even though the conclusion is false for
Proving by Contradiction
Based on the idea that ( ) [ ]
Theorem : For all integer is odd, then is odd
𝑝 𝑞
Proof by contradiction :
Let is odd
is evenfalse conclusion
Some
Let be even
Since is even , for some integer
⇒ 3 𝑛+ 2=6 𝑘+ 2=2(3 𝑘+1)
is even
Proving a Statement by Contradiction
To prove that is true by contradiction
Show that ] ] is true
] can be true only if is true
Theorem : show that is irrational
is even, say =
GCD(a, b) 1 ¬𝑟
is even, say =
References for Today’s Lecture