This web site will be updated from time to time, so if you want information that's most up to date, then be sure to check back here again. Any important changes will be in the announcements, so at least check there. Of course, I'll also announce things in class, so you can ignore this web site completely if that's what you want.

The course also appears on UCR's Blackboard site. I will use that site for three things:

- Sending announcements to you by email;
- Maintaining a discussion board; and
- Keeping track of your grades (under Student Tools).

If your email address on Blackboard (also under Student Tools), is missing or wrong, then you won't get announcements by email, but they'll still show up on both that site and this site. Note that the Blackboard site requires Javascript to work.

Discrete mathematics is also called "Finite Mathematics"; in fact, that's the official title for this course. I think that this name refers to the absence of calculus' infinite limit processes. But don't assume that all of the mathematical objects that we'll be dealing with are finite. In particular, we will cover recursion, a concept which inherently contains a potential infinity.

The **optional book** for this course is
2000 Solved Problems in Discrete Mathematics,
by Seymour Lipschutz, published (1991) by McGraw-Hill.
This should be available at the
bookstore,
or you can
search
for it online.

The **alternate book** for this course is
Discrete Mathematics and its Applications,
by Kenneth H. Rosen, 4th edition (1998), published by McGraw-Hill.
If you already have this book,
then you don't have to buy the Lipschutz & Lipson.
But this book is much more expensive.

A book **not recommended** for this course is
Schaum's Easy Outline of Discrete Mathematics.
This is an abridgement of the required text,
but it doesn't contain all of the material that we'll be studying.

There is more information about the books.

- Week 1: Logic and sets
- Week 2: Proofs
- Week 3: Counting
- Week 4: Relations
- Week 5: Graphs and review
- August 29: Final exam, 7:30 to 9:30

There is a more detailed schedule.

Numerically, I will grade harshly -- it's hard to get 100% on any assignment. On the other hand, the correspondence between numerical grades and letter grades is nicer than most math courses:

- [100%, ∞): A+
- [93%, 100%): A
- [86%, 93%): A-
- [79%, 86%): B+
- [71%, 79%): B
- [64%, 71%): B-
- [57%, 64%): C+
- [50%, 57%): C
- [43%, 50%): C-
- [36%, 43%): D+
- [29%, 36%): D
- [21%, 29%): D-
- [0, 21%): F

Here, "[*x*%, *y*%)"
means «at least *x*% but less than *y*%».
There is no rounding; an average of 49.99% is not enough for a C.

There will be 4 projects worth 10% each, 4 homework assignments worth 5% each, and 1 examination worth 40%. There may also be occasional quizzes, but these won't contribute to your grade. The final exam is August 29 Friday, and it starts at 7:30, not 8:00, so don't be late!

The homework is also available here online. There is more information about the projects.

- PlanetMath, a free encyclopaedia of mathematics written by mathematicians;
- MathWorld, an encyclopaedia of mathematics written by astrophysicist Eric Weisstein;
- Wikipedia, a free encyclopaedia of everything written by anybody that shows up, which has fairly good coverage of many mathematics topics.

This web page was written in 2003 and 2004 by Toby Bartels. Toby reserves no legal rights to it.

The permanent URI of this web page
is
`http://tobybartels.name/MATH112/2003/`

.