Professional Documents
Culture Documents
Course Description
MAT 173 Discrete Mathematics 4-0-4
Introduction to the non-continuous side of mathematics; methods of proof, logic,
sets, relations, functions, and number theory, mathematical induction, counting
techniques and graph theory. This course is designed for students who plan to major
in mathematics or computer science. Prerequisite: Grade of C or above in MAT
170 or permission of the Instructor.
2. Final Exam
There will be a final exam given during the schools final exam period. It will be
cumulative and worth 200 points. Students with an 85 or higher overall average will
not be required to take the final exam and will receive the appropriate letter grade
based on your current average. If you are not required to take the final but take it
anyway, your grade can only improve. The final course grade will be determined by
whichever is higher, the overall course average or the final exam grade. For
example, if your overall course grade is a 75 and you earn a 90 on the final, then
your final course grade will be a 90. Any student with less than an 85 is required to
take the final, and anyone required to take the final that does not do so will fail the
course.
3. Homework
Homework will be assigned at the end of every class and will be discussed during
the next class session. The homework will be collected for a completion grade of 3
points per assignment. You should plan to complete each assignment. Homework
should be thought of as practice in order to learn the material and to do well on
exams. Since this course is based mainly on proofs and their constructions, it is
imperative to practice with the homework. Homework will be based on the
questions in each lecture section of the electronic course textbook. There are
approximately 61 assignments and 60 of them will be graded. Homework will not
be accepted once a test has been given over that material.
4. Quizzes
There will be no quizzes given throughout the semester.
6. Common Courtesies
Talk with your friends before or after class but not during.
No headphones are to be worn in class.
Arrive on time with paper, textbook, calculator, and all electronics turned off.
No calculator sharing is allowed. Each student must use/provide their own.
7. Extra Help
If you find yourself struggling at any point during the course, please see me
immediately! Be sure to come to office hours for extra help. If you cannot make it
during the posted office hours, please see me after class or email me to make an
appointment. The sooner you seek help the better!! You can also take advantage
of the Math Lab located in the Evans Library for additional tutoring services.
Chapter Topics
1 Logic
1.1 Propositions and Logical Operations
1.2 Compound Propositions
1.3 Conditional Statements
1.4 Logical Equivalence
1.5 Laws of Propositional Logic
1.6 Predicates and Quantifiers
1.7 Quantified Statements
1.8 DeMorgans Law For Quantified Statements
1.9 Nested Quantifiers
1.11 Logical Reasoning
1.12 Rules of Inference With Propositions
1.13 Rules of Inference With Quantifiers
Exam #1 (will cover Chapter 1)
2 Proofs
2.1 Introduction To Proofs
2.2 Direct Proofs
2.3 Proof by Contrapositive
2.4 Proof by Contradiction
2.5 Proof by Cases
Exam #2 (will cover Chapter 2)
3 Sets
3.1 Sets and Subsets
3.2 Sets of Sets
3.3 Union and Intersection
3.4 More Set Operations
3.5 Set Identities
3.6 Cartesian Products
3.7 Partitions
Exam #3 (will cover Chapter 3)
4 Functions
4.1 Definition of Functions
4.2 Floor and Ceiling
4.3 Properties of Functions
4.4 Inverse of a Function
4.5 Composition of Functions
4.6 Logarithms and Exponents
6 Relations/Digraphs
6.3 Directed Graphs
6.6 Matrix Multiplication
Exam #4 (will cover Chapters 4 and 6)
8 Induction and Recursion
8.1 Sequences
8.2 Recurrence Relations
8.3 Summations
8.4 Mathematical Induction
8.5 More Inductive Proofs
8.6 Strong Induction
8.7 Recursive Definitions
8.11 Linear Recurrence Relations
9 Integer Properties
9.1 Division Algorithm
9.2 Modular Arithmetic
9.3 Prime Factorization
9.4 Factoring and Primality Testing
9.5 GCD and Euclids Algorithm
9.6 Number Representation
Exam #5 (will cover Chapters 8 and 9)
10 Introduction to Counting
10.1 Sum and Product Rules
10.2 Bijection Rule
10.3 Generalized Product Rule Permutations
10.4 Counting Permutations
10.5 Counting Subsets
10.6 Subset and Permutation Examples
10.7 Counting By Complement
10.8 Permutations With Repetitions
10.9 Counting Multisets
10.10 Assignment Problems: Balls in Bins
10.11 Inclusion-Exclusion Principle
11 Advanced Counting
11.1 Generating Permutations and Combinations
11.2 Binomial Coefficients
11.3 Pigeonhole Principle
11.4 Generating Functions
Exam #6 (will cover Chapters 10, 11, and 12*)
R Review
Final Exam (will cover Chapters 1-4, 6, 8-12)
Grading Method
Numerical grades will be calculated by dividing the total points earned by the total
points possible.
Exams 500 Points (5 best scores, 100 points each, worth 74% of
your grade)
Homework 180 Points (60 assignments, 3 points each, worth 26% of
your grade)
Total 680 Points
-----------------------------------------------------------------------------------------------------------------
--------------
Final 200 Points
Final course grade will be determined by the higher average between the exams
and quizzes versus the final exam.
Grading Scale
A 609-680
B 541-608
C 473-540
D 405-472
F 0-404
Attendance Policy
Attendance is an important part of the learning process. As such, you should attend
the full class every day. There is a direct correlation between attendance and your
grade. Without regular attendance, it is difficult to succeed in this class and you
may miss important announcements regarding course material and exams and
quizzes. Students are expected to attend class in a regular and punctual manner. If
you miss class, it is your responsibility to get any missed work. Anyone attaining
perfect attendance for the entire semester will receive 20 extra credit points added
on to their final points total for the class.
FM Sustainability Statement
Disclaimer
All policies and subsections of this syllabus are subject to change and revision at the
instructors discretion. I reserve the right to implement missed tests and quizzes on
a case-by-case basis. If you are diligent with your work and attend lecture on a
regular basis and participate actively in class, then I may allow missed work to be
made up. You may come to me and discuss your individual situation to see whether
it merits a make-up item or not. If you are habitually absent and are not performing
well in class, then the likelihood of you being allowed to make-up any material
missed will be severely limited. Again, this will be decided on a case-by-case,
individual basis. All tests and/or quizzes that are permitted to be made up must be
done so before they are passed back to the rest of the class which is usually one
day.