CHAPTER 5

Contrapositive Proof

e now examine an alternative to direct proof called contrapositive

proof. Like direct proof, the technique of contrapositive proof is
used to prove conditional statements of the form If P , then Q . Although
it is possible to use direct proof exclusively, there are occasions where
contrapositive proof is much easier.

5.1 Contrapositive Proof

To understand how contrapositive proof works, imagine that you need to
prove a proposition of the following form.
Proposition

If P , then Q .

This is a conditional statement of form P Q . Our goal is to show

that this conditional statement is true. Recall that in Section 2.6 we
observed that P Q is logically equivalent to Q P . For convenience,
we duplicate the truth table that verifies this fact.
P

P Q

Q P

According to the table, statements P Q and Q P are different

ways of expressing exactly the same thing. The expression Q P is
called the contrapositive form of P Q .1
1 Do not confuse the words contrapositive and converse. Recall from Section 2.4 that the

converse of P Q is the statement Q P , which is not logically equivalent to P Q .

Contrapositive Proof

103

Since P Q is logically equivalent to Q P , it follows that to prove

P Q is true, it suffices to instead prove that Q P is true. If we were
to use direct proof to show Q P is true, we would assume Q is true
use this to deduce that P is true. This in fact is the basic approach of
contrapositive proof, summarized as follows.
Outline for Contrapositive Proof
Proposition

If P , then Q .

Proof. Suppose Q .
..
.

Therefore P .

So the setup for contrapositive proof is very simple. The first line of the
proof is the sentence Suppose Q is not true. (Or something to that effect.)
The last line is the sentence Therefore P is not true. Between the first
and last line we use logic and definitions to transform the statement Q
to the statement P .
To illustrate this new technique, and to contrast it with direct proof,
we now prove a proposition in two ways: first with direct proof and then
with contrapositive proof.
Proposition

Suppose x Z. If 7 x + 9 is even, then x is odd.

Proof. (Direct) Suppose 7 x + 9 is even.

Thus 7 x + 9 = 2a for some integer a.
Subtracting 6 x + 9 from both sides, we get x = 2a 6 x 9.
Thus x = 2a 6 x 9 = 2a 6 x 10 + 1 = 2(a 3 x 5) + 1.
Consequently x = 2b + 1, where b = a 3 x 5 Z.
Therefore x is odd.

Here is a contrapositive proof of the same statement:

Proposition

Suppose x Z. If 7 x + 9 is even, then x is odd.

Proof. (Contrapositive) Suppose x is not odd.

Thus x is even, so x = 2a for some integer a.
Then 7 x + 9 = 7(2a) + 9 = 14a + 8 + 1 = 2(7a + 4) + 1.
Therefore 7 x + 9 = 2b + 1, where b is the integer 7a + 4.
Consequently 7 x + 9 is odd.
Therefore 7 x + 9 is not even.

Contrapositive Proof

104

Though the proofs are of equal length, you may feel that the contrapositive proof flowed more smoothly. This is because it is easier to
transform information about x into information about 7 x + 9 than the other
way around. For our next example, consider the following proposition
concerning an integer x:
Proposition

If x2 6 x + 5 is even, then x is odd.

A direct proof would be problematic. We would begin by assuming that

x 6 x + 5 is even, so x2 6 x + 5 = 2a. Then we would need to transform this
into x = 2b + 1 for b Z. But it is not quite clear how that could be done,
for it would involve isolating an x from the quadratic expression. However
the proof becomes very simple if we use contrapositive proof.
2

Proposition

Suppose x Z. If x2 6 x + 5 is even, then x is odd.

Proof. (Contrapositive) Suppose x is not odd.

Thus x is even, so x = 2a for some integer a.
So x2 6 x+5 = (2a)2 6(2a)+5 = 4a2 12a +5 = 4a2 12a +4+1 = 2(2a2 6a +2)+1.
Therefore x2 6 x + 5 = 2b + 1, where b is the integer 2a2 6a + 2.
Consequently x2 6 x + 5 is odd.
Therefore x2 6 x + 5 is not even.

In summary, since x being not odd ( Q ) resulted in x2 6 x + 5 being not

even ( P ), then x2 6 x + 5 being even (P ) means that x is odd (Q ). Thus
we have proved P Q by proving Q P . Here is another example:
Proposition

Suppose x, y R. If y3 + yx2 x3 + x y2 , then y x.

Proof. (Contrapositive) Suppose it is not true that y x, so y > x.

Then y x > 0. Multiply both sides of y x > 0 by the positive value x2 + y2 .
( y x)( x2 + y2 ) > 0( x2 + y2 )

yx2 + y3 x3 x y2
3

y + yx

> 0
>

x3 + x y2

Therefore y3 + yx2 > x3 + x y2 , so it is not true that y3 + yx2 x3 + x y2 .

Proving If P , then Q , with the contrapositive approach necessarily

involves the negated statements P and Q . In working with these we
may have to use the techniques for negating statements (e.g., DeMorgans
laws) discussed in Section 2.10. We consider such an example next.

Congruence of Integers
Proposition

105

Suppose x, y Z. If 5 - x y, then 5 - x and 5 - y.

Proof. (Contrapositive) Suppose it is not true that 5 - x and 5 - y.

By DeMorgans law, it is not true that 5 - x or it is not true that 5 - y.
Therefore 5 | x or 5 | y. We consider these possibilities separately.
Case 1. Suppose 5 | x. Then x = 5a for some a Z.
From this we get x y = 5(a y), and that means 5 | x y.
Case 2. Suppose 5 | y. Then y = 5a for some a Z.
From this we get x y = 5(ax), and that means 5 | x y.
The above cases show that 5 | x y, so it is not true that 5 - x y.

5.2 Congruence of Integers

This is a good time to introduce a new definition. It is not necessarily
related to contrapositive proof, but introducing it now ensures that we
have a sufficient variety of exercises to practice all our proof techniques on.
This new definition occurs in many branches of mathematics, and it will
surely play a role in some of your later courses. But our primary reason
for introducing it is that it will give us more practice in writing proofs.
Definition 5.1 Given integers a and b and an n N, we say that a and b
are congruent modulo n if n | (a b). We express this as a b (mod n).
If a and b are not congruent modulo n, we write this as a 6 b (mod n).
Example 5.1

Here are some examples:

1. 9 1 (mod 4) because 4 | (9 1).

2. 6 10 (mod 4) because 4 | (6 10).
3. 14 6 8 (mod 4) because 4 - (14 8).
4. 20 4 (mod 8) because 8 | (20 4).
5. 17 4 (mod 3) because 3 | (17 (4)).
In practical terms, a b (mod n) means that a and b have the same
remainder when divided by n. For example, we saw above that 6 10
(mod 4) and indeed 6 and 10 both have remainder 2 when divided by 4.
Also we saw 14 6 8 (mod 4), and sure enough 14 has remainder 2 when
divided by 4, while 8 has remainder 0.
To see that this is true in general, note that if a and b both have the
same remainder r when divided by n, then it follows that a = kn + r and
b = ` n + r for some k, ` Z. Then a b = ( kn + r ) (` n + r ) = n( k `). But
a b = n( k `) means n | (a b), so a b (mod n). Conversely, one of the
exercises for this chapter asks you to show that if a b (mod n), then a
and b have the same remainder when divided by n.

Contrapositive Proof

106

We conclude this section with several proofs involving congruence of

integers, but you will also test your skills with other proofs in the exercises.
Proposition

Let a, b Z and n N. If a b (mod n), then a2 b2 (mod n).

Proof. We will use direct proof. Suppose a b (mod n).

By definition of congruence of integers, this means n | (a b).
Then by definition of divisibility, there is an integer c for which a b = nc.
Now multiply both sides of this equation by a + b.
ab

(a b)(a + b) =

a2 b 2

nc
nc(a + b)
nc(a + b)

Since c(a + b) Z, the above equation tells us n | (a2 b2 ).

According to Definition 5.1, this gives a2 b2 (mod n).

Lets pause to consider this propositions meaning. It says a b (mod n)

implies a2 b2 (mod n). In other words, it says that if integers a and b
have the same remainder when divided by n, then a2 and b2 also have
the same remainder when divided by n. As an example of this, 6 and 10
have the same remainder (2) when divided by n = 4, and their squares
36 and 100 also have the same remainder (0) when divided by n = 4. The
proposition promises this will happen for all a, b and n. In our examples
we tend to concentrate more on how to prove propositions than on what
the propositions mean. This is reasonable since our main goal is to learn
how to prove statements. But it is helpful to sometimes also think about
the meaning of what we prove.
Proposition

Let a, b, c Z and n N. If a b (mod n), then ac bc (mod n).

Proof. We employ direct proof. Suppose a b (mod n). By Definition 5.1,

it follows that n | (a b). Therefore, by definition of divisibility, there exists
an integer k for which a b = nk. Multiply both sides of this equation
by c to get ac bc = nkc. Thus ac bc = n( kc) where kc Z, which means
n | (ac bc). By Definition 5.1, we have ac bc (mod n).

Contrapositive proof seems to be the best approach in the next example,

since it will eliminate the symbols - and 6.

Mathematical Writing
Proposition

107

Suppose a, b Z and n N. If 12a 6 12 b (mod n), then n - 12.

Proof. (Contrapositive) Suppose n | 12, so there is an integer c for which

12 = nc. Now reason as follows.
nc

12 =
12(a b) =
12a 12 b

nc(a b)
n( ca cb)

Since ca cb Z, the equation 12a 12 b = n( ca cb) implies n | (12a 12b).

This in turn means 12a 12b (mod n).

5.3 Mathematical Writing

Now that we have begun writing proofs, it is a good time to contemplate the
craft of writing. Unlike logic and mathematics, where there is a clear-cut
distinction between what is right or wrong, the difference between good
and bad writing is sometimes a matter of opinion. But there are some
standard guidelines that will make your writing clearer. Some of these
are listed below.
1. Begin each sentence with a word, not a mathematical symbol.
The reason is that sentences begin with capital letters, but mathematical
symbols are case sensitive. Because x and X can have entirely different
meanings, putting such symbols at the beginning of a sentence can lead
to ambiguity. Here are some examples of bad usage (marked with )
and good usage (marked with X).
A is a subset of B.
The set A is a subset of B.

x is an integer, so 2 x + 5 is an integer.
Because x is an integer, 2 x + 5 is an integer.

x2 x + 2 = 0 has two solutions.

X 2 x + 2 = 0 has two solutions.
The equation x2 x + 2 = 0 has two solutions.

(and silly too)

2. End each sentence with a period, even when the sentence ends
with a mathematical symbol or expression.
1
X
Y 1
=
s
1
pP 1 p s
k=1 k
1
X
Y 1
Euler proved that
=
.
s
1
pP 1 s
k=1 k

Euler proved that

Contrapositive Proof

108

Mathematical statements (equations, etc.) are like English phrases that

happen to contain special symbols, so use normal punctuation.
3. Separate mathematical symbols and expressions with words.
Not doing this can cause confusion by making distinct expressions
appear to merge into one. Compare the clarity of the following examples.
Because x2 1 = 0, x = 1 or x = 1.
Because x2 1 = 0, it follows that x = 1 or x = 1.

Unlike A B, A B equals ;.
Unlike A B, the set A B equals ;.

4. Avoid misuse of symbols. Symbols such as =, , , , etc., are not

words. While it is appropriate to use them in mathematical expressions,
they are out of place in other contexts.
Since the two sets are =, one is a subset of the other.
Since the two sets are equal, one is a subset of the other.

The empty set is a of every set.

The empty set is a subset of every set.

Since a is odd and x odd x2 odd, a2 is odd.

Since a is odd and any odd number squared is odd, then a2 is odd.X
5. Avoid using unnecessary symbols. Mathematics is confusing enough
without them. Dont muddy the water even more.
No set X has negative cardinality.
No set has negative cardinality.

6. Use the first person plural. In mathematical writing, it is common

to use the words we and us rather than I, you or me. It is as if
the reader and writer are having a conversation, with the writer guiding
the reader through the details of the proof.
7. Use the active voice. This is just a suggestion, but the active voice
makes your writing more lively.
The value x = 3 is obtained through the division of both sides by 5.
Dividing both sides by 5, we get the value x = 3.
X
8. Explain each new symbol. In writing a proof, you must explain the
meaning of every new symbol you introduce. Failure to do this can lead
to ambiguity, misunderstanding and mistakes. For example, consider
the following two possibilities for a sentence in a proof, where a and b
have been introduced on a previous line.

Mathematical Writing

109

Since a | b, it follows that b = ac.

Since a | b, it follows that b = ac for some integer c.

If you use the first form, then a reader who has been carefully following
your proof may momentarily scan backwards looking for where the c
entered into the picture, not realizing at first that it came from the
definition of divides.
9. Watch out for it. The pronoun it can cause confusion when it is
unclear what it refers to. If there is any possibility of confusion, you
should avoid the word it. Here is an example:
Since X Y , and 0 < | X |, we see that it is not empty.

Is it X or Y ? Either one would make sense, but which do we mean?

Since X Y , and 0 < | X |, we see that Y is not empty.

10. Since, because, as, for, so. In proofs, it is common to use these
words as conjunctions joining two statements, and meaning that one
statement is true and as a consequence the other true. The following
statements all mean that P is true (or assumed to be true) and as a
consequence Q is true also.
Q since P
Since P , Q

Q because P
Because P , Q

Q , as P
as P , Q

Q , for P

P , so Q

Notice that the meaning of these constructions is different from that of

If P , then Q , for they are asserting not only that P implies Q , but also
that P is true. Exercise care in using them. It must be the case that P
and Q are both statements and that Q really does follow from P .
x N, so Z
x N, so x Z

11. Thus, hence, therefore consequently. These adverbs precede a

statement that follows logically from previous sentences or clauses. Be
sure that a statement follows them.
Therefore 2k + 1.
Therefore a = 2k + 1.

12. Clarity is the gold standard of mathematical writing. If you

believe breaking a rule makes your writing clearer, then break the rule.
Your mathematical writing will evolve with practice useage. One of the
best ways to develop a good mathematical writing style is to read other
peoples proofs. Adopt what works and avoid what doesnt.

110

Contrapositive Proof

Exercises for Chapter 5

A. Use the method of contrapositive proof to prove the following statements. (In
each case you should also think about how a direct proof would work. You will
find in most cases that contrapositive is easier.)
1. Suppose n Z. If n2 is even, then n is even.
2. Suppose n Z. If n2 is odd, then n is odd.
3. Suppose a, b Z. If a2 (b2 2 b) is odd, then a and b are odd.
4. Suppose a, b, c Z. If a does not divide bc, then a does not divide b.
5. Suppose x R. If x2 + 5 x < 0 then x < 0.
6. Suppose x R. If x3 x > 0 then x > 1.
7. Suppose a, b Z. If both ab and a + b are even, then both a and b are even.
8. Suppose x R. If x5 4 x4 + 3 x3 x2 + 3 x 4 0, then x 0.
9. Suppose n Z. If 3 - n2 , then 3 - n.
10. Suppose x, y, z Z and x 6= 0. If x - yz, then x - y and x - z.
11. Suppose x, y Z. If x2 ( y + 3) is even, then x is even or y is odd.
12. Suppose a Z. If a2 is not divisible by 4, then a is odd.
13. Suppose x R. If x5 + 7 x3 + 5 x x4 + x2 + 8, then x 0.
B. Prove the following statements using either direct or contrapositive proof.
Sometimes one approach will be much easier than the other.
14. If a, b Z and a and b have the same parity, then 3a + 7 and 7 b 4 do not.
15. Suppose x Z. If x3 1 is even, then x is odd.
16. Suppose x Z. If x + y is even, then x and y have the same parity.
17. If n is odd, then 8 | (n2 1).
18. For any a, b Z, it follows that (a + b)3 a3 + b3 (mod 3).
19. Let a, b Z and n N. If a b (mod n) and a c (mod n), then c b (mod n).
20. If a Z and a 1 (mod 5), then a2 1 (mod 5).
21. Let a, b Z and n N. If a b (mod n), then a3 b3 (mod n)
22. Let a Z, n N. If a has remainder r when divided by n, then a r (mod n).
23. Let a, b, c Z and n N. If a b (mod n), then ca cb (mod n).
24. If a b (mod n) and c d (mod n), then ac bd (mod n).
25. If n N and 2n 1 is prime, then n is prime.
26. If n = 2k 1 for k N, then every entry in Row n of Pascals Triangle is odd.

27. If a 0 (mod 4) or a 1 (mod 4), then a2 is even.
28. If n Z, then 4 - (n2 3).
29. If integers a and b are not both zero, then gcd(a, b) = gcd(a b, b).
30. If a b (mod n), then gcd(a, n) = gcd(b, n).
31. Suppose the division algorithm applied to a and b yields a = qb + r . Then
gcd(a, b) = gcd(r, b).