Mathematics for Computer Science

MIT 6.042J/18.062J Proof by Contradiction

3
Is 1332 ≤ 11?
Proof by Contradiction 1331
11331
If so, 1332 ≤ 1 3

That’s not true, so

3
1332 > 11
Albert R Meyer February 11, 2013 contradiction.1 Albert R Meyer February 11, 2013 contradiction.2

Proof by Contradiction Proof by Contradiction

Theorem: 2 is irrational.
If an assertion implies
something false, then •  Suppose 2 was rational

the assertion itself

•  So have n, d integers without common
prime factors such that
n
must be false! 2=
d
•  We will show that n & d are both even.
This contradicts no common factor.
Albert R Meyer February 11, 2013 contradiction.3 Albert R Meyer February 11, 2013 contradiction.4

Proof by Contradiction Quickie

Theorem: 2 is irrational. Proof assumes that
so can assume
n n = 2k if n2 is even, then n is even.
2=
d n2 = 4k2 Why is this true?
2d =n QED 2d2 = 4k2
d2 = 2k2
2d2 = n2
So n is even So d is even

Albert R Meyer February 11, 2013 contradiction.5 Albert R Meyer February 11, 2013 contradiction.6

1
MIT OpenCourseWare
http://ocw.mit.edu

6.042J / 18.062J Mathematics for Computer Science

Spring 2015

For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.