# MTHSC 3190-001; 3190-002 Syllabus

Fall 2013

**Time: **9:05 - 9:55 M,W,F. (section 1)

**Time: **10:10 - 11:00 M,W,F. (section 2)

**Location: **M203 Martin.

**Instructor:** Kevin James

**Office: **O-21 Martin Hall

**Phone:**(864) 656-6766 (office)
(864) 656-3434 (Dept)

**Email: **kevja@clemson.edu

**Web: **http://www.ces.clemson.edu/~kevja/

### Office Hours

Office hours are by appointment. Please email me to set up an
appointment.

### Required Text

The text for this course is ``Mathematics, A Discrete Introduction,''
2nd
Edition by Edward
R. Scheinerman.

### Goals and Objectives.

The purpose of this class is to aid students as they transition from
lower-level courses which are more computational (such as those in the
calculus sequence) to upper-level courses with more mathematical rigor.
This course will prepare students for courses in which the reading and
writing of proofs is considered routine. The topics of the course are also
intended to introduce the students to the basic objects which will be used
and expanded upon in higher-level courses.

### Course Contents

We will parts of sections 1-16, 19-25, 29-30, 34-36 from the textbook.
Other sections will be covered if time permits. We will also supplement
the textbook with lectures on topics from analysis such as limits,
continuity and differentiability of functions.

### Topics

Topics will include but are not limited to the following:
- Proof techniques (direct proof, proof by the contrapositive, proof by contradiction, induction)
- Quantifiers and proofs of statements involving quantifiers
- Counterexamples
- Basic set theory
- Functions
- Relations and equivalence relations
- Selected topics from elementary number theory
- Counting techniques

### Learning Outcomes

At the end of this course, the student will be able to:
- Construct proofs of conditional and biconditional statements.
- Demonstrate that a statement is false by supplying a counterexample.
- Write an induction proof.
- Apply counting techniques.
- Determine properties of a relation and justify such properties.

### Time Requirements.

Please be sure to devote at least six hours per week outside of class
to
this course.

### Grading Policies

The grading in this class will be as follows:
- 3 In-class Exams 20% each
- Quizzes and Homework 15%
- Cumulative Final Exam 25%

All exams will be cumulative.
The following grading scale will be used:

A |
90-100 |
B |
80-89 |
C |
70-79 |
D |
60-69 |
F |
0-59 |

All grading will be on the basis of your work shown and not on the
answer alone.

### Make-up Policy

Absolutely **NO** late homework will be accepted and there will be **No**
make-ups for missed quizes or exams. In the event, that a student misses an
exam due to a documented excused absence, that student's final exam score
will be substituted for the missing exam score. Any student who misses an
exam and cannot provide documentation indicating that the absence was
excused will recieve a 0 for the exam.

### Attendance Policy.

You are expected to be regular and punctual in your class attendance.
You are expected to be in your seat at the beginning of the period and to
remain through the period until dismissed. The instructor reserves the right
to drop any students wh accumulates more than 6 absences.
If the instructor is late, the class should begin a review of
homework problems. After 25 minutes, the class may leave.

### Academic Integrity

As members of the Clemson University community, we have inherited
Thomas
Green Clemson's vision of this institution as a high seminary of
learning.
Fundamental to this vision is a mutual commitment to truthfulness,
honor,
and responsibility, without which we cannot earn the trust and respect
of
others. Furthermore, we recognize that academic dishonesty detracts
from
the value of a Clemson degree. Therefore, we shall not tolerate lying,
cheating,
or stealing in any form.