Course Description
-- Math 215 -- Spring 2009Instructor: Louis H. Kauffman
Office: 533 SEO
Phone: (312) 996-3066
E-mail: kauffman@uic.edu
Web page: http://www.math.uic.edu/~kauffman
Text Book: An Introduction to Mathematical Reasoning, Cambridge Univ. Press, by P. Eccles
Office Hours: 2:15PM to 3:00PM on MWF.
Prereqisites: Grade of C or better in MATH 181 and approval of the department.
FINAL EXAM: Thursday, May 7, 2009. 10:30AM to 12:30PM in BSB 315.
The structure of the exam is as follows. There are five questions that you are required to do. These questions involve things that you know well, and it is mostly a matter of calmly thinking them through and writing out the proofs or solutions. Then you are asked to do ONE more problem, chosen from several more problems stated on the exam. These problems involve some of the special things that we did like sprouts, Euler formula, something about complex numbers, possibly switches, or combinatorial coefficients, etc. But there are a number of problems to choose from and I am sure that you will find one of them that you will feel comfortable working with. Study for this exam by thinking through those parts of the course that you like and those parts that you have found challenging. Please use this time to work on your understanding of proofs and ideas.
See FinalExam.This is a copy of our final with selected solutions to some of the problems. If you have questions about how to solve these problems contact the instructor.
Description: This is a first course in theoretical mathematics. It is a prerequisite to all advanced theoretical courses in the department. The Primary Goal of the course is to learn how to create and write mathematical proofs. We will introduce basic proof techniques, like proofs by induction and contradiction. We will also learn some basic mathematics that will be used in many advanced courses including: sets, functions, equivalence relations, cardinality and infinite sets. As time permits, we will cover most of Parts I-III and parts of Part V of the text.
The course will proceed via a projects and problems. We will begin with a series of problems involving games played on graphs. In playing these games we directly encounter a number of mathematical phenomena and we will all work on finding proofs that these phenomena are actually happening!
Because the course is structured through evolving problem sets and projects, it is essential that you WORK ON THE PROBLEMS AND ATTEND ALL THE CLASSES. There is no recourse here to staying away from class. If you miss a class, please see the instructor and get a recapitulation of what went on in that class. Credit in the course will be a function of your homework and of hour exams and the final exam. In this course HOMEWORK IS OF PRIMARY IMPORTANCE.
Keep watching this webpage for problems and notes related to the course.
See Sprouts. This is your first project and homework assignments. These begin with the graphical game of "sprouts", problems about mathematical induction and problems related to Euler's formula for plane graphs.
See Conway's Sprouts. This is an excerpt from the book "Winning Ways for Your Mathematical Plays" by Conway, Berlekamp and Guy. It contains more information about sprouts.
See Logic and Switching Circuits. This is a discussion of problems relating logic and switching circuits.
See Problems. This is a list of all problems assigned in the course so far.
See Sample Problems. This is a list of sample problems for the course as a whole.
See TakeHomeExam for the instructions for the essay on Logic, Sets and Mathematics that is due on Wednesday, April 29, 2009.
See Axioms. This is a list of the axioms that apply to intgers to rational numbers and to real numbers. These axioms are in the book on pages 18-19 and page 24. We put them together here for your reference.
See Peano Axioms for a list of the Peano axioms for the natural numbers and a list of problems to prove, using these axioms.
See KELLEY Excerpt on basic mathematics from book by John Kelley, part of the telvision course "Continental Classroon" that Kelley gave in 1960.
See Wang Algebra for a clever approach to graphs and spanning trees.