# Order of Topics in Introductory Proofs Class

Beginning next semester I am teaching a course in proofs and mathematical problem solving at my local university. For some background, the university is primarily a commuter university and the students I will be teaching will be mostly math education, and computer science students.

I am teaching from the book Introduction to Mathematical Thinking by Scott A. Vanstone and Will J. Gilbert. The departmental course outline suggests starting at Chapter 2 - which would mean beginning with topics such as divisibility, diophantine equations, integers in different bases and prime numbers before talking about logic, sets, proofs and methods of proofs (this stuff is given in chapter 1).

While I prefer starting in chapter 1 I see that there may be some wisdom to starting with very concrete topics and moving foward. But if I do not explain proofs and logic from the start I will be unable to prove any of the small intermediate results that are given in chapter 2.

Additionally, I was thinking of opening the class with an excercise using missing entries of a sudoku puzzle and having the students explain what numbers go in the missing entries and writing and explanation of why they believe it. I want to use this exercise to introduce direct proof, proof by cases and proof by contradiction to the students.

My questions are:

1) I was wondering if someone has experienced teaching a course of this nature and has any recommendations on the suggested progression for the beginning of the course.

2) Assuming I start with chapter 2, would it still be a good idea to start with the sudoku exercise - and if so, how would I naturally segue from it into the rest of the class.

I teach such a course to mathematics majors, a somewhat different audience, and I find there are always some who are little unclear about "if-then" vs. "and", quantifiers, and free/bound variables. I mean that in a practical sense -- they confuse themselves, "accidentally" as it were. Theoretical instruction in formal logic helps only a few; they need examples to clarify formal logic, at which point formal logic might be useful to them.

I teach the formal stuff and proof structures and so on, but I have to keep in mind the pitfalls above that my students are facing. I haven't thought about what examples can be shown with sudoku, but it seems a good thing to use, if you can create good examples with them. (It will be fun for many of them, but don't be surprised if not all find it so. It's a hard criterion, to please everybody.) Now you're talking about proof by cases and proof by contradiction, but the pitfalls I mentioned seem more elementary to me. They seem like they should be addressed before getting to cases and contradiction. Probably that can be done with sudoku. (I'll give an example of mine later.)

How I start. All my students have had at least a year of calculus. Many of them are still quite good at calculus. So I use continuous functions and differentiable functions for examples. I ask them to come up with functions that are continuous (C) or not at, say, $x=1$, or differentiable (D) or not. I ask them how many combinations are possible and help them see all four, (C, D), (C, not D), etc. Now not all four are in fact achievable. Why? Someone will say because a differentiable function is continuous. Then we look at "$f$ is D and $f$ is C" and "If $f$ is D, then $f$ is C." Before addressing the implication, I make sure they all agree it is true (because it is a theorem, it has a proof). I put the examples they come up with in a table with the logical values T/F in columns for C and D. Then I go over the meaning of "and" and "if-then". The relation to the rest of the course, which you asked about, is this. I use and reuse the examples when we talk about proving "if-then", whenever confusion arises, and whenever I feel clarification is needed.
I also use other examples. Using a non-theorem is good for illustrating how to show an implication is false. A simple one is "if $x^2 > 4$, then $x > 2$", where $x$ represents an integer or a real number (but be sure to include negative numbers).