Summer 2009-Math 220 Finite Mathematics: Number Theory, Combinatorics, and Graphs
Syllabus
There is the syllabus on line, and key information is listed below.
to top↑Textbook
I will use my own notes so you don't need to buy any textbook. But if you want to have some books for reference, for your information,my lectures will be based on the following book:
Discrete Mathematics for Computer Science by Kenneth Bogart, Clifford Stein and Robert L. Drysdale. ISBN 1-930190-86-7.
There are some good examples in this book: Finite Mathematics: an Applied Approach by Sullivan and Mizrahi, tenth edition. ISBN 0-471-32899-5.
You don't need to purchase them.
to top↑Topics
This is an introduction to some topics in finite Mathematics: number theory, combinatorics and graph theory. We will see both thoeries and applications.
In the book of Discrete Mathematics for Computer Science, the correspondent sections are Chapters 1, 2 and 6.
to top↑Time and Location
1:00PM - 2:45PM MTWRF-- from July 13 to August 13 at Room 215, Cupples One Hall
to top↑Office Hours
TBA
to top↑Grading
For the final grade, homework counts 70% and three exams count 30%(each exam counts equally 10%).
to top↑Exams
We have three main topics, so we have three exams to cover them respectively.
Exam 1, Number Theory: July 23, Thursday
Exam 2, Combinatorics: August 4, Tuesday
Exam 3, Graph Theory: August 13, Thursday
to top↑Homework Assignments
Homework 1 and solutions
Homework 2 and solutions
Homework 3(at the "Problems" section) and solutions
Homework 4 and solutions
to top↑Handouts
Lecture11, July 28 : Examples of Fibonacci sequence
to top↑