Math 1165 -Discrete Mathematics
Instructors: Dr. Stas Molchanov
and Dr. Harold Reiter,
hbreiter@email.uncc.edu
You must have a special program
Adobe Acrobat
Reader to access these lectures. You can can download from this
website
.
If you're accessing these tests from a UNCC computer, you should not have any
problems. If you do, please let me know:
mailto:hbreiter@email.uncc.edu
The Lectures.
These lectures will be corrected and updated during the Fall semester.
- Lecture 0 Introduction
- Lecture 1 Number Theory
Homework set 1;
Solutions, Homework set 1;
- Lecture 2 The Euclidean Algorithm,
Representations of Integers
Homework set 2;
Solutions, Homework set 2;
- Lecture 3 Mathematical Induction
Homework set 3;
Solutions, Homework set 3;
Provided below is a set of old homework problems and their solutions.
Sample problems;
sample problem solutions;
- Lecture 4 Inequalities, Induction, and
Recursion
Homework set 4;
Solutions, Homework set 4;
- Lecture 5 Set Theory
Homework set 5;
Solutions, Homework set 5;
Homework set 5B;
Solutions, Homework set 5B;
- Lecture 6 Operations on Sets
Homework set 6;
Solutions, Homework set 6;
- Lecture 7 Combinatorics
Homework set 7;
Solutions, Homework set 7;
- Lecture 8 Probability;
Homework set 8;
Solutions, Homework set 8;
- Lecture 9 Digraphs and Relations
- Lecture 9B Equivalence Relations and Posets
Homework set 9;
Solutions, Homework set 9
- Lecture 10, Graphs
- Lecture 11, Graph Optimization
- Lecture 12, Boolean Functions and Circuit Design
Study Guides
Study guide for test 1;
Study guide for test 2;
Study guide for test 3;
Other websites of interest