Method of Indirect Proof

Nama : Maya Jenita Simatupang
NIM : 4203331001
Class : CESP 2020
Courses : Routine Task of Elementary Mathemathics
Supporting Lecturer : Andrea Arifsyah Nasution, S.Pd.,M.Sc
METHOD OF INDIRECT PROOF
1. Indirect proof is a method of proving mathematical statements by changing the

order of sentences. There are two methods of proving indirectly, namely
contrapositive proof and proof of contradiction.
Indirect proof is usually used when a mathematical statement is difficult to prove
using direct proof.
 Proof of Contrapositive
Contrapositive or contraposition are sentences that have truth as well as
implication. The contraposition sentence form is ~q → ~ p. The "~" symbol is
called negation.
e.g.
Implication p→ q
if it rains, the soil will be wet.
Contraposition ~ q → ~ p
if it doesn't get wet, it doesn't rain.
We will use the previous example problem to make it easier to understand the
method of proof indirectly.
Example: counterpositive proof

if 5a + 2, then a is an even number. Prove it using contrapositive indirect proof.
answer:
p = 5a + 2 even
q = a is an even number
~ p = 5a + 2 odd
~ q = a is an odd number
contrapositive ~ q→ ~ p
we assume ~ q is true, that is a = 2k-1, k Є Z+ (odd)

5a+2 = 5a+2
= 5(2k-1)+2
=10k-5+2
=10k-3
=(10k-2)-1
=2(5k-1)-1
=2b-1
5a+2 = 2b-1, b Є Z+
The contraposition is proven true, meaning that the statement "if 5a + 2 is even,
then a is an even number" is true.
 Proof of Contradiction
From the very origin of the word it is clear, "counter" means the opposite or the
opposite. The proof of the contradiction is a bit logical indeed, so I will explain it
slowly.
Just as the implication is equivalent to a contraposition, it turns out that the
negation of the implication is equivalent to another statement. The following is a
form of statement which is equivalent to the negation of implication.
~ (p → q) ≡ p^~ q
A statement in the form of implication p q has the inverse / negation ~(p →q). if
the implication is true then it is certain that the negation is wrong, right? Or, if
the implication is false then surely the negation is true.
Now in proving a contradiction, we want to prove that the statement p→ q is
true, the way is to prove that the negation is a false statement.
In order to be able to state that the negation is wrong, we first assume that the
negation is correct. then we prove these assumptions and draw a conclusion.
Example: proof of contradiction

prove the statement below using indirect evidence of contradiction!
"if 5a + 2 is even, then a is an even number"
answer:
p: 5a + 2 even
q: a is an even number
~q: a is an odd number
will be proved that p q is true

Assume p ^ ~q is true, that is 5a + 2 is an even number and a is an odd number
a = 2k-1, k Є Z+ (odd)
5a + 2 = 5a + 2
= 5(2k-1)+2
=10k-5+2
=10k-3
=(10k-2)-1
=2(5k-1)-1
5a+2 = 2m-1, m Є Z+
The result is an odd number, contradicting the original assumption that 5a + 2 is

even.
Means that the statement p ^ ~q is false, the correct one is p→q, namely "if 5a + 2
is even, then a is an even number".
Prove the truth of each statement given.

1. √ 3 is an irrational number.
Ans:
√ 3 = p/q
3 = p2/q2
3.q2 = p2
3q2 is a multiple of 3 so p2 is also a multiple of 3
with p=3k, then
3q2 = p2
3q2 = (3k)2
3q2 = 9k2
q2 = 3k2
It can be seen that q2 is divisible by 3 then q is divisible by 3.
Then true √ 3 is an irrational number.
2. The sum of two rational numbers is rational.

Ans:
a
Previously, rational numbers were numbers can be expressed in fraction
b
form where a and b were integers.
a
If 2 rational numbers are added, call it the first number and the second
b
c
number . With a, b, c, d integers.
d
a c ad +bc
+ =
b d bd
ad is an integer
bc is an integer
Then, ad + bc is also an integer
bd is an integer.
Since both the numerator and denominator satisfy, every two rational
numbers added must be rational.
3. 0<a<b if only if a2 < b2
Ans:
e.g. a and b real numbers.

A conclusion to the statement where P → Q where P is the statement 0 <a <b
and Q is the statement a2 <b2.
Then, because a> 0, if multiplied by a then the inequality 0 <a <b satisfies
0<a2 <ab, so does b> 0, if multiplied by b then the inequality 0 <a <b satisfies
0 <ab <b2. ordering, we get 0 <a2 <ab <b2. so, if 0 <a <b then a2 <b2 is true.
1 1
4. 0<a<b if and only if >
a b
Ans:
1 1 1
If 0 <a <b then ab> 0 and it means > 0. And as a result we have: − =¿
ab a b
b−a 1 1 1 1 1
=(b−a) . >0considering that b−a> 0. So < or > is proven true.
ab ab b a a b
a+b
5. If a <b, then a < <b
2
Ans:
1 b
we can suppose a and b real numbers. a<b if it’s multiplied by( ), then a<b
2 2
a+b 1 a
satisfies <b .That otherwise if it’s multiplied by ( ), then a<b satisfies
2 2 2
a+b a+ b a+ b
a< . We can change the order be a< < b . So if a<b then a< < b is
2 2 2
true.

Method of Indirect Proof

Uploaded by

Copyright:

Available Formats

Method of Indirect Proof

Uploaded by

Document Information

Original Title

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

Method of Indirect Proof

Uploaded by

Copyright:

Available Formats

Nama : Maya Jenita Simatupang

METHOD OF INDIRECT PROOF

1. Indirect proof is a method of proving mathematical statements by changing the

Example: counterpositive proof

we assume ~ q is true, that is a = 2k-1, k Є Z+ (odd)

Example: proof of contradiction

will be proved that p q is true

The result is an odd number, contradicting the original assumption that 5a + 2 is

Prove the truth of each statement given.

3q2 is a multiple of 3 so p2 is also a multiple of 3

with p=3k, then

It can be seen that q2 is divisible by 3 then q is divisible by 3.

Then true √ 3 is an irrational number.

2. The sum of two rational numbers is rational.

Then, ad + bc is also an integer

e.g. a and b real numbers.

You might also like

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