Scribd
Upload
22 views

Lecture in Methods of Proofs

There are three main types of proofs: direct proofs, indirect proofs, and mathematical induction. Direct proofs use modus ponens to show that if a statement P is true, then the resulting statement Q must also be true. Indirect proofs use modus tollens, assuming the conclusion is false to show the premise must also be false. Mathematical induction proves properties of positive integers, first showing a basis at 1 is true, then assuming the property holds for an integer n to show it must also hold for n+1.

Uploaded by

Ruzzellita Gayares
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
22 views

Lecture in Methods of Proofs

There are three main types of proofs: direct proofs, indirect proofs, and mathematical induction. Direct proofs use modus ponens to show that if a statement P is true, then the resulting statement Q must also be true. Indirect proofs use modus tollens, assuming the conclusion is false to show the premise must also be false. Mathematical induction proves properties of positive integers, first showing a basis at 1 is true, then assuming the property holds for an integer n to show it must also hold for n+1.

Uploaded by

Ruzzellita Gayares
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

Methods of Proofs

In general there are two most common types of proof, the inductive and the deductive
methods of proof. For the purpose of discussion we are going to discuss three types’ namely
direct proofs, indirect proofs and mathematical induction.

Direct proof (inductive method)


The direct proof follows the principles of “Modus Pones”. Given a certain statements
“P”, the results of this statements, Q, is true whenever P is found to be true.
Recall:
P
P →Q
∴Q

Indirect proof
The indirect direct proof or most commonly known as the proof by contradiction simply
follows the principles of “Modus Tollens”. For a statement, assuming the conclusion to be false
will result to a false cause.
Recall:
P →Q
~Q
∴~P

Mathematical Induction
This method is the most common way of proving mathematical propositions involving a
series of positive integers.

First Principle of mathematical induction (Principle of Finite Induction)


Let S be a set of positive integers with the properties
(a) 1 belongs to S, and
(b) whenever the integer k is in S, then the next integer k + 1 must be in S.
Then S is the set of all positive integers.
The following are the procedure of mathematical induction
Step 1: Verification
Given a certain property, verify whether 1 posses this property.
Step 2: Induction Hypothesis
If 1 posses this property, then given positive integer n this integer posses the same
property.
Step 3: Proof of the Induction
Assuming that the hypothesis is true for every integer n then this must be true for integer
n + 1.
Step 4: Conclusion
If the proposition is true for integer n + 1 then it will be hold to all positive integers.

You might also like