**Problem of the Week**

**Number Theory Conf.**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

You are here: Homepage » People » Graduate Students » Ding Ding » Teach » Math 314 Discrete Mathematics

people:grads:ding:teach:314

Math 314-02 Discrete Mathematics

Fall 2014

**Instructor:**Ding Ding**Email:**ding@math.binghamton.edu**Office:**OW-335**Meeting time & location:**MWF 8:00-9:30 at LH-004**Office hours:**T: 12:00-2:00, W 11:00-12:00, or by appointment

If you need to reach me, please e-mail ding@math.binghamton.edu.

*Please include [Math314] in the subject line of your email, or your email may not be read promptly.*

Math 221 (grade C or above).

The purpose of this course is twofold. On one hand, we explore counting properties and methods related to the natural numbers ℕ, as well as properties and algorithms on graphs and trees. On the other hand, it presents all those properties in a logical fashion, so that we can understand and justify why they are correct. Among the proof techniques that we will use for the purpose, the most important one is “Mathematical Induction”

By the end of the semester students are expected to be familiar with the counting properties and methods related to the natural numbers, as well as properties and algorithms on graphs and trees. Students are also expected to understand and be able to justify why these properties, methods and algorithms are correct.

This course is a 4-credit course, which means that in addition to the scheduled lectures/discussions, students are expected to do at least 9.5 hours of course-related work each week during the semester. This includes things like: completing assigned readings and homework, studying for tests and examinations, preparing written assignments, and other tasks that must be completed to earn credit in the course.

** Discrete Mathematics** by L. Lovász, J. Pelikán and K. Vesztergombi, Springer, 2003

- This is the course text. All homework assignments will come from this book.
- The first part of the book, chapters 1-6, deals with counting properties and methods related to the natural numbers ℕ. The second part, chapters 7-15, deal with properties and algorithms on graphs and trees, and some related topics.
- We plan to cover most of the material in parts I and II, following closely the order and logic framework of the textbook.

Attendance is partially mandatory, enforced by the daily quizzes. Following the academic policy listed in the University Bulletin, the instructor will *NOT* grade exams of any student missing more than *25%* of the quizzes. The final grade will be an *F* if a student misses more than 25% of the quizzes. See more details in the Grading section below.

For the semester of Fall 2014, missing more than 3 quizzes without an advance notice will lead to an F.

**Quizzes (20 %), two tests (30 %, with 15% each), a midterm exam (20%) and a final exam (30 %).**- There are 12 regular quizzes scheduled, one per week of class. No quiz is scheduled for a class session that is immediate after a test. Each quiz will be graded on the scale from 0 to 10.
- If you miss an exam, test or quiz, your score for that exam, test or quiz will be a zero.
- The lowest two quiz grades will be dropped when the final total grade is calculated. Hence only 10 out of the 12 quizzes are counted.

Components | Dates | Percentage | Time allowed |
||

Quiz | Weekly | 20% | 10 minutes * (12-2) | ||

Test 1 | Monday, Sept. 29 | 15% | 90 minutes | ||

Midterm | Wednesday, Oct. 22 | 20% | 90 minutes | ||

Test 3 | Monday, Nov. 17 | 15% | 90 minutes | ||

Final | Monday, Dec. 15 | 30% | 120 minutes | ||

TOTAL | 100% |

- Homework will be assigned on Wednesdays of each week and due on Wednesdays of the following week.
- Homework will be sent to you via email as well as posted at Homework Page.
- Homework assignments will
be graded. Students are welcome to discuss the homework with the instructor during office hours.*not*

- Quizzes will be given at the end of a class session.
- Quiz problems are chosen from previous homework assignments either in exactly same forms or with some modifications. It is highly recommended that a student finishes homework by him- or herself.
- Quizzes are always
**closed-booked**. - No make-up is given for quizzes.

- Sept. 12: Course add and drop/delete deadline.
- Oct. 31: Course withdraw/change grade option deadline.

Note that a “Pass” grade in the “Pass/Fail” grade option does not count toward math degrees. If you are a math major, it is not advised to change the grade option to “Pass/Fail” unless you are ready to retake the course at a later time.

If you need to take a make-up, if possible, an advance request should be given. Checkable written proof to justify the request should be given.

In order to minimize the need for make-up exams and the stress of dealing with multiple exams, within the first two weeks of the semester, all students must check the exam schedules of other courses they are taking and make sure that there is no major conflict. The exam dates may be changed accordingly only if the instructor determines necessary.

Students found cheating will be reported to the Provost Office following the academic procedure listed in the University Bulletin. Laptop and electrical communication devices cannot be used in a quiz, test or exam. Calculator in a cellphone cannot be used. Calculators are in general not allowed.

If you are used to using calculators, you should practice on homework problems without using a calculator.

No laptop usage in classroom. Text messaging should be minimal. Late arrivals, early departures, cell phone conversations, eating and drinking, etc., are inappropriate behaviors. According to the Faculty-Staff Handbook, the instructor may ask those who, in the instructor’s judgment, have seriously impaired the class’s ability to achieve the objectiveness of the course, to leave the classroom.

people/grads/ding/teach/314.txt · Last modified: 2015/01/27 21:35 by ding

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported