Illinois State University Mathematics Department
MAT 409: Topics in Algebra and Combinatorics for K8 Teachers Summer 2006 
Course Syllabus 









Interest in computer science and the use of computer applications, together with connections to many realworld situations, have helped make topics of discrete mathematics more commonplace in school and college curricula. A topic of widespread application and interest is combinatorics, the study of counting techniques.
Enumeration, or counting, may strike one as an obvious process that a student learns when first studying arithmetic. But then, it seems, very little attention is paid to further developments in counting as the student turns to "more difficult" areas in mathematics, such as algebra, geometry, trigonometry, and calculus. . . . Enumeration [however] does not end with arithmetic. It also has applications in such areas as coding theory, probability, and statistics (in mathematics) and in the analysis of algorithms (in computer science). [Ralph P. Grimaldi, in Discrete and Combinatorial Mathematics, 1994, p. 3]Documents that support the reform of school mathematics education suggest the need for increased attention to topics in discrete mathematics as well as in probability and statistics. The topic of combinatoricscountingis mentioned in the National Council of Teachers of Mathematics' Curriculum and Evaluation Standards for School Mathematics (1989) and in Principles and Standards for School Mathematics (2000). The Mathematical Association of America's recommendations for teacher preparation identify combinatorics as a topic area worthy of study by middle school and high school teachers.In this course we will study and apply combinatorial techniques in a variety of settings. In doing so, we will make connections to algebra, probability, geometry, number theory, and many other topics in mathematics. During the course, we may also study the process of proof by induction, the use of recursion, and the generation of polynomials.Combinatorial Analysis is an area of mathematics concerned with solving problems for which the number of possibilities is finite (though possibly quite large). These problems may be broken into three main categories: determining existence, counting, and optimization. Sometimes it is not clear whether a problem has a solution or not. This is a question of existence. In other cases solutions are known to exist, but we want to know how many there are. This is a counting problem. Or a solution may be desired that is "best" in some sense. This is an optimization problem. [John A. Dossey, Albert D. Otto, Lawrence E. Spence, & Charles Vanden Eynden, in Discrete Mathematics, 1987, p. 1]
The course text is Explorations in Combinatorial Reasoning by Roger Day, Available from PIP Printing in the Bone Student Center (Course Packet #7).
Office Hours & Contact Information
Office: Room 329C Stevenson Hall: I am available before and after class and at other times as well. Please see me to schedule an appointment.
email: day@ilstu.edu
URL: http://www.math.ilstu.edu/day
current course URL: http://www.math.ilstu.edu/day/courses/current/409
previous course URL: http://www.math.ilstu.edu/day/courses/old/305
Course Requirements and Grading Scale
Quizzes, Homework, Course Participation (15%)
These may be occasional quizzes during the course. Some homework assignments may be collected and graded. Participation inclass discussions and explorations is expected and documented.
Tests (3 @ 20%)
Three exams will be given during the course. Tests will likely be conducted the last class day of each week, unless otherwise announced during a class session. Part or all of one or more exams may be a takehome exam. Specific restrictions for such takehome portions will be stated when the takehome portion is distributed.
Course Examination (25%)
A comprehensive course exam will be completed Thursday, 13 July, beginning at 1:25 pm.
Course grades are based on these requirements. I will use a distribution no more severe than A: 92100%, B: 8491%, C: 7683%, D: 6876%, F: <68%.Please refer to the grade guidelines for additional information on grade determination and expectations. There also is information on my expectations for your submission of work in the course.
Course materials are available electronically through a Worldwide Web home page for the course: http://www.math.ilstu.edu/day/courses/current/409.
STV 302 is open regularly for student use. There are multiple copies of many books, booklets, pamphlets, and journals. You may use the materials there or check them out on a limited basis.
Attendance, Makeup Work, and Extra Credit
Your active involvementindividually, in small groups, and with the entire classis an important way for you to help meet the course objectives. For you to be involved, you must be present. If you are now aware of attendance conflicts or should you become aware of such conflicts, please let me know of them as soon as possible.
The deadlines, due dates, and test dates described in the written course requirements and announced during class are just that. Makeup work is negotiated on an individual basis and only under emergency situations. No course credit will be given for work submitted after the due date. Plan ahead to complete the required tasks on time; be prepared for quizzes, tests, and the course exam.
The course requirements are designed to meet the objectives of the course. Unless announced otherwise, there is no extra credit as a substitute for successful completion of the required components of the course.
I invite and appreciate your comments and suggestions for the course as it unfolds. Please share with me in person or in writing your reactions and perceptions. Your contributions will serve to enhance the course for you, your classmates, and future students.





