1. Mathematical Proof Look what I can make this function do! (No, that’s not the trick.) These are all prime numbers! This is neither prime nor composite. But as long as we stick with counting numbers… Proposition: The function p(x) defined above will give prime numbers for every counting number x. All it would take would be ONE number x to give a composite number p(x), and the proposition would be false.

2. Mathematical Proof • But if the proposition is true, I want • a way to convince myself, • a way to convince a skeptic. We can expect an argument.

3. Mathematical Proof • But if the proposition is true, I want • a way to convince myself, • a way to convince a skeptic. We can expect an argument.

4. Mathematical Proof proof “An argument is a connected series of statements to establish a definite proposition.” • A mathematical proof is a sequence of statements in which • each statement • is self-evident to mathematicians, or • follows from earlier statements by logic with which mathematicians agree. • and • the last statement is the proposition you want to establish.

5. Mathematical Proof • A mathematical proof is a sequence of statements in which • each statement • is self-evident to mathematicians, or • follows from earlier statements by logic with which mathematicians agree. • and • the last statement is the proposition you want to establish. A well-written mathematical proof also has an introduction, guiding comments, and a conclusion to help the reader. To see what this means, let me show you two proofs…

6. Mathematical Proof • Proof #1: Not well-written. • Hypothesis: A = B • A + C = A + C • A + C = B + C • If A = B, then A + C = B + C

7. Mathematical Proof • Proof #2: Better writing. • I will prove that if A = B, then A + C = B + C. • To do this, I will show that if I assume A = B, I can prove that A + C = B + C. • So… • A = B (my hypothesis) • A + C = A + C (reflexive property of equality) • A + C = B + C (replacement property of equality, used on statement 2) • Now I have proven that if I assume A = B, I can prove that A + C = B + C. • Therefore I have proven that • If A = B, then A + C = B + C • This concludes the proof.

8. Mathematical Proof If you find it easy to follow the proof, the “helpful” parts of the writing may be unnecessary for you, even distracting. • But when the proof is challenging for you to understand, it helps to know: • The goal of the proof, • The logical “flow” of the proof, and • The reasons that you should agree with the more difficult statements in the proof. This is the reason for the “style” of a well-written proof, and this is the reason that you are learning it.

9. Mathematical Proof A more important proof for section 12.4. I want to prove that this equation is true for every counting number n: To do this, I will use the method of mathematical induction. First I will prove that the equation is true when n = 1. Left-hand side: Right-hand side: The two sides are equal. The equation is true when n = 1. Now I will show that for every counting number k, if the equation is true when n = k, it must also be true when n = k + 1. To do this, I will show that if I assume that the equation is true for n = k, I can prove that the equation is also true for n = k + 1.

10. Mathematical Proof A more important proof for section 12.4. I want to prove that this equation is true for every counting number n: Inductive hypothesis Reflexive property of equality Replacement of equals So the equation is true for n = k + 1.

11. Mathematical Proof A more important proof for section 12.4. I want to prove that this equation is true for every counting number n: • I have proven that • the equation is true for n = 1, and • for every counting number k, if the equation is true when n = k, it must also be true when n = k + 1. • Therefore the equation must be true for every counting number n. • QED.

12. Mathematical Induction • Parts of an induction proof: • Introduction (“I will prove by induction that P is true for every counting number n”) • Proof of P when n = 1 Textbook calls this “Condition I.” • Proof that whenever P is true for n = k, P must also be true for n = k+1. Textbook calls this “Condition II.” • The inductive hypothesis (“assume P is true for n = k“) • From the inductive hypothesis, prove that P must be true for n = k+1. • Conclusion (“…therefore P is true for every counting number n.”) • Technical Challenges: • Writing P when n =1. • Writing P when n = k. • Writing P when n = k+1. • Proving the case for n = k+1.