**General Information and office hours:**My office is Mathematics 240A. My office telephone number is 426-3011.I am teaching Math 187 and Math 275 in Fall 2018. My classes are M187 12--12:50 MWF, M275 9--10:15 MWF.

I am the coordinator for M488, the senior outcomes assessment activity, which meets once on a Saturday morning later in the semester in our computer lab Mathematics 136 (there will be two alternative dates TBA). I have the regular weekly PBC meeting at a time TBA, and logic seminar weekly at a time TBA. I am proposing to have time wih my graduate student 1-3 Thursdays, and class office hours MWF

*tentatively*10:30--11:30 pm and 3--4 pm. At other times MWF from about 8:30 am until about 5 pm I'm very possibly to be found in my office. TTh I do not know what my routine will be.

- Monday, 24 Sept. Returned Test I papers. Lectured on section 12. There will be more discussion of section 12 on Wednesday.
First section 12 assignment: 12.1, 12.2, 12.3, 12.4, 12.7, 12.10, 12.21, 12.24 (a hint for the exercise given in class). Read problem 12.22 on complements of sets.
I will post solutions for Test I in the next day or two.

- Friday, 21st Sept: Covered section 11 on quantifiers. Homework: 11.1 acegi; 11.2 acegi; 11.4, 11.5. Due next Wednesday the 26th.
- Monday and Wednesday, 17th and 19th: review for and administration of Test I. It should be graded and returned by Monday.

- Friday, Sept 14: we are having a computer lab, in our regular room. You will need Python to run the software we are using; you do not need to know anything about Python! The software itself is here. What we are going to do with this file is "edit it in IDLE" (a Python function, I'll circulate to help you with it) and run it. Then I will do a demonstraton of the software and we will work on this lab. This text file contains some commands set up to be pasted into the Python window. The lab is due in a week or so.
- Wednesday, Sept 12: Discussed section 10; Section 10 homework, due after the exam (but included in exam coverage): 10.1aceg, 10.2 ac (set-builder notation is what I called property notation in the lecture), 10.3 (tricky because you are counting abstract things; read carefully; I might give away a part or two in class), 10.4, 10.6, 10.10 (I did this in class!).
On Friday we are having a computer lab. Please bring your laptop computer and make sure some recent version of Python is installed on it. More information will appear here.

- Monday, Sept 10: Jean Schneider will be lecturing sections 8 and 9. Homework: 8.4, 8.6, 8.8, 8.10, 8.12, 8.16. 8.18; 9.2, 9.4, 9.6, 9.8. 9.11 is interesting to think about. This is due on Friday.

- Friday, Sept 7: The second exercise set in the manual of logical style will be assigned today and due next Friday, the 14th. Test I is delayed until the 19th. I'm giving you the extra day because Jean Schneider, who is lecturing on Monday, is probably not ready to answer questions about my formal logic setup -- you will be able to ask questions on Wednesday the 12th before the 14th when it is due. I think I said in class on the 12th that the logic exercises were due on Monday the 17th, so I'll let them go until then.
- Wednesday, Sept 5: No new assignment, as we are still working on new logic rules involving negation. You do have exercises to turn in Friday.

- Friday, August 31: Typo in Wednesday handout is fixed!
Your homework is the set of exercises on p. 14 of the manual of logical style, due next Friday. Happy Labor Day! (but I would start working on these proofs in the long weekend: questions

**will**arise!) - Wednesday, August 29: discussed truth tables and started discussion of formal proof techniques. Your homework is this worksheet, due next Wed (as Mon is Labor Day).
- Monday, August 27: discussed section 6 on counterexamples. Homework: 6.3, 6.4, 6.5, 6.8, 6.9 (this, 6.9, is an interesting one: first, find a counterexample. An intelligent search strategy will do this very quickly. Then, find the *first* counterexample. This eliminates the possibility of an intelligent search strategy, and one will find something out which is interesting and surprising.), 6.11.

- Friday, 8/24/2018: section 5. Homework from section 5: 5.1, 5.2, 5.5, 5.6, 5.7, 5.9, 5.10, 5.13 (harder than the one we did in class!), 5.20 (read rules for inequalities in Appendix D carefully). I may do one or two of the earlier problems in class.
From the axioms given on page 482, prove that x0 = 0. This can be done but is surprisingly tricky. You aren't going to lose points in the course if you can't do it.

- Wednesday, 8/22/2018: section 4. Homework from section 4: 4.1, 4.3, 4.4, 4.5, 4.6, 4.10, 4.12 (an open ended exploration problem): of parts abcd, try at least two parts).
- Monday, 8/20/2018: section 3. Homework from section 3: 3.1, 3.2, 3.4 (your definition in 3.4 should use the notions of natural number and addition and nothing else to define the notion "the integer x is less (or equal to?) than the integer y"), 3.9 (they mean "on the line segment between A and B", to be defined in terms of distance), 3.12 (this one will definitely require some discussion on Wednesday :-)
This assignment is due on Friday the 24th. I won't always say when an assignment is due: the method of computing due dates is given above.

In addition, we define a natural number n as

**special**just in case there is exactly one m strictly between 1 and n which is a factor of n. Compare with the definition of**composite**. Identify all the numbers between 1 and 50 which are special. Give a brief definition of special numbers in terms of familiar concepts.

Fall 2006 Test I. Here is the Spring 2012 Test I paper.

Here is the Spring 2013 Test I paper with solutions. Here is the Fall 2013 Test I paper with solutions. Here is the Fall 2016 Test I paper with solutions. Here are the Fall 2017 Test I and II papers with solutions. These tests are rather different from yours; we were using a different book. There are some relevant questions in Test 1, and there are two formal proof questions in Test II. Here is the Spring 2018 Test I.