Scribd
Upload
18 views14 pages

Mod1 1

The document outlines various proof techniques in mathematics, including direct proof, proof by contradiction, and mathematical induction. It provides examples for each method, illustrating how to establish the truth of statements through logical reasoning. The document emphasizes the importance of these techniques in proving mathematical assertions effectively.

Uploaded by

pandiaraj ayyappan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views14 pages

Mod1 1

The document outlines various proof techniques in mathematics, including direct proof, proof by contradiction, and mathematical induction. It provides examples for each method, illustrating how to establish the truth of statements through logical reasoning. The document emphasizes the importance of these techniques in proving mathematical assertions effectively.

Uploaded by

pandiaraj ayyappan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Proof Techniques

A proof involves a q (p implies q)


There are several methods for establishing a proof of statements.
Some of them are
1. Direct proof
2. By contradiction
3. By mathematical induction.
4. Indirect proof / By Contrapositive
5. Deductive proof
Direct proof
If we have to prove that p q, then a direct proof assumes p is true
and try to prove q is true.
Example: 1
Prove for any integer a and b if a and b are odd then ab is odd.
Solution: Any odd integer u, can be written as 2v+1, where v is an integer.
Given that a and b are odd integer, by the above statement
a = 2x + 1 and b = 2y + 1 , where x, y are integers.
Use this fact and prove the product ab is also odd.
ab = (2x +1) (2y+1) = 4xy + 2x + 2y + 1 = 2(2xy + x + y) + 1 = 2w+1
where w = 2xy + x + y is an integer.
Hence, ab is an odd number.
Proof by contradiction
We need to prove p q.
A contradiction is a propositional form which is always false.
Assume that P is true and Assume that ¬Q is true.
Use P and ¬Q to demonstrate a contradiction. ¬Q must be false. Q is
true
Proof by contradiction
Example 1:
If a and b are consecutive integers, then the sum a + b is odd.
Assume a and b are consecutive integers and the sum a + b is not
odd
Since sum a + b is not odd, there exists no number k such that a + b
= 2k + 1
However, the integers a and b are consecutive, means a+b=2a+1
we have derived that a + b 2k + 1 for any integer k and also that
a + b = 2a + 1. This is a contradiction.
sum a + b is not odd is false. sum a + b is odd
Proof by contradiction
Example 2:
Prove for any integer a and b if a and b are odd then ab is odd.
Solution: To prove this, assume the contrary that ab is even.
ab is even implies, ab = 2z , for some integer z.
Given that a and b are odd integer, by the above statement
a = 2x + 1 and b = 2y + 1 , where x, y are integers.
Therefore, ab = 4xy + 2x + 2y + 1 = 2z
z = 2xy + x + y +(½)
z is not an integer and hence a contradiction. ab odd an
number.
Example 3:
A rational number is a number that can be expressed as the ratio of two
integers n and m have no common factor. A real number that is not rational is
said to be irrational.
Show that is irrational.
Solution: Assume the contrary that is rational.
is rational implies, = n/m ---------------- (1)
where n and m are integers andhave no common factor.
From (1), 2m2 = n2 ---------------- (2)
implies n2 is even and hence n is even.
Therefore, we can write n = 2k for some integer k.
From (2), 2m2 = 4k2
m2= 2k2 implies m2 is even and hence mis even.
This is contradiction to the fact that n and m have no common factor.
Proof by mathematical induction
Proof by mathematical induction consists of three basic steps. If the
statement p is to be proved then:
1) Show that p is true for some particular integer n0
- this is called Basis
2) Assume p is true for some particular integer 0
- this is called Induction hypothesis
3) Then to prove is true for k+1
- this is called Induction step
Example 1
Show that for any , 1 + 2 + . . . + n = n(n+1)/2
Solution:
Let P(n) : 1 + 2 + . . . + n = n(n+1)/2
Basis step: P(1) : 1 = 1(1+1)/2 = 1
P(1) is true.
Induction hypothesis: Assume that P(k) is true for some k.
P(k): 1 + 2 + . . . + k = k(k+1)/2 ------------(1)
Induction step: To prove P(k+1) is also true.
Take the LHS P(k+1) and prove the RHS.
1 + 2 + . . . + k + (k+1) = k(k+1)/2 + (k+1) = (k+1) (k/2 +1) using (1)
= (k+1)(k+2)/2
Therefore, P(k+1) is true and hence P(n) is true for any n.
Example 2 Step 1 - Basis

Step 3
- IS:
Step 2
- IH:
Cont
Example 3
Cont..
Example 4

You might also like

pFad - Phonifier reborn

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

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy