Scribd
Upload
178 views2 pages

Mathcentre Direct PDF

The document discusses direct proofs. It provides examples of direct proofs for statements such as: if n is an odd integer then n^2 is also odd; if a divides b and a divides c then a divides b + c; and if m and n are odd integers then mn is also odd. It also provides exercises asking to directly prove statements like: if n is an even integer then 7n + 4 is even; and if a, b and c are integers such that a divides b and b divides c then a divides c.

Uploaded by

MarlaFirmalino
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
178 views2 pages

Mathcentre Direct PDF

The document discusses direct proofs. It provides examples of direct proofs for statements such as: if n is an odd integer then n^2 is also odd; if a divides b and a divides c then a divides b + c; and if m and n are odd integers then mn is also odd. It also provides exercises asking to directly prove statements like: if n is an even integer then 7n + 4 is even; and if a, b and c are integers such that a divides b and b divides c then a divides c.

Uploaded by

MarlaFirmalino
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/ 2

community project

mathcentre community project


encouraging academics to share maths support resources
All mccp resources are released under an Attribution Non-commerical Share Alike licence

Direct Proof
mccp-dobson-0211

Introduction
A direct proof is one of the most familiar forms of proof. We use it to prove statements of the
form ”if p then q” or ”p implies q” which we can write as p ⇒ q. The method of the proof is to
takes an original statement p, which we assume to be true, and use it to show directly that another
statement q is true. So a direct proof has the following steps:

• Assume the statement p is true.

• Use what we know about p and other facts as necessary to deduce that another statement q
is true, that is show p ⇒ q is true.

Example

Directly prove that if n is an odd integer then n2 is also an odd integer.

Solution

Let p be the statement that n is an odd integer and q be the statement that n2 is an odd integer.
Assume that n is an odd integer, then by definition n = 2k + 1 for some integer k. We will now use
this to show that n2 is also an odd integer.

n2 = (2k + 1)2 since n = 2k + 1


= (2k + 1)(2k + 1)
= 4k 2 + 2k + 2k + 1 by expanding the brackets
= 4k 2 + 4k + 1
= 2(2k 2 + 2k) + 1 since 2 is a common factor.

Hence we have shown that n2 has the form of an odd integer since 2k 2 + 2k is an integer. Therefore
we have shown that p ⇒ q and so we have completed our proof.

Example

Let a, b and c be integers, directly prove that if a divides b and a divides c then a also divides b + c.

Solution

Let a, b and c be integers and assume that a divides b and a divides c. Then as a divides b, by
definition, there is some integer k such that b = ak. Also as a divides c, by definition, there is
some integer l such that c = al. Note that we use different letters k and l to stand for the integers

c
Katy Dobson Alan Slomson
www.mathcentre.ac.uk University of Leeds University of Leeds
because we do not know if b and c are equal or not. We will now use these two facts to get our
conclusion. So

b + c = (ak) + (al) by our definitions of b and c


mathcentre community project
= a(k + l) since a is a common factor.
encouraging
+ mccp
Hence a divides b All c since k + l academics
is an integer.to share maths support resources
resources are released under an Attribution Non-commerical Share Alike licence

Example

Directly prove that if m and n are odd integers then mn is also an odd integer.

Solution

Assume that m and n are odd integers. Then by definition m = 2k + 1 for some integer k and
n = 2l + 1 for some integer l. Again note that we have used different integers k and l in the
definitions of m and n. We will now use this to show that mn is also an odd integer.

mn = (2k + 1)(2l + 1) by our definitions of m and n


= 4kl + 2k + 2l + 1 by expanding the brackets
= 2(2kl + k + l) + 1 since 2 is a common factor.

Hence we have shown that mn has the form of an odd integer since 2kl + k + l is an integer.

Example

Let m and n be integers. Directly prove that if m and n are perfect squares then mn is also a perfect
square.

Solution

Recall the definition that an integer m is a perfect square if m = k 2 for some integer k. Now assume
that m and n are integers and are perfect squares. Then by definition m = k 2 for some integer k
and n = l2 for some integer l. We will now use these facts to show that mn is also a perfect square.

mn = k 2 l2 = (kl)2

and kl is an integer, therefore mn is a perfect square.

Exercises

Prove directly that

1. If n is an even integer then 7n + 4 is an even integer.

2. If m is an even integer and n is an odd integer then m + n is an odd integer.

3. If m is an even integer and n is an odd integer then mn is an even integer.

4. If a, b and c are integers such that a divides b and b divides c then a divides c.

c
Katy Dobson Alan Slomson
www.mathcentre.ac.uk University of Leeds University of Leeds

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