The easiest way to arrange an appointment, or to get a hold of me in general, is by email.
CRN: 21403
Lectures: Tuesday, Thursday 14:30-15:45 (SCI2 Room 306).
Webpage:
http://courses.csusm.edu/math474ak
The webpage contains useful information, like the homework assignments, general announcements, and clarifications regarding the homework. You should check it at least once a week.
|
|
Late homeworks will not be accepted.
| January 5: | First day of classes |
| February 17: | Midterm 1 |
| March 23: | Midterm 2 |
| March 27-April 3: | Spring break (no classes) |
| April 27: | Midterm 3 |
| May 6: | Last day of classes | May 13: | Final Exam, 1:45-3:45PM |
It is also legitimate to discuss assignment problems with other students in the class or consult other texts. Assignments must be written up completely by yourself using only the text and your own notes as aids. The point is that your written report should be your own work. Do not let other students even look at your completed assignment solutions, since this can lead to copying. These rules are meant to ensure that all students understand their solutions to the problems well enough to write up solutions by themselves. If challenged you must be able to reproduce and explain your work.
Failure to comply with these guidelines is a serious academic offense. Penalties for such violations range from receiving a zero on the homework to suspension from the university.
On the first page of each homework assignment you must explicitly list all students with whom you have discussed assignment problems (even briefly) and which problems you discussed with each student. If you have discussed the homework with no one except me, write ``NO OUTSIDE DISCUSSION''. You must also list all other texts and aids that you have consulted. If you have consulted no text except the textbook and course notes, write ``NO EXTRA TEXT CONSULTED''. Without these statements, your assignment may not be graded and you will be penalized.
The core material consists of the pigeonhole principle, combinations (binomial coefficients) and permutations (factorials), recurrence relations (and how to solve them), generating functions, and the principle of Inclusion/Exclusion. We will also encounter some assorted topics, like partially ordered sets, derangements, Fibonacci numbers, Catalan numbers, Stirling numbers, and a bit on design theory.