Math 321: Discrete Mathematics

Fall 2016 - Mark Arrasmith

License

All content listed on this page including the videos is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 United States License. Click here for a copy of the license.

Content

You can find the standard course documents on Blackboard. Assignments are to be uploaded to Blackboard as well.

Introduction

• Syllabus
• Math = Toys + Rules
• Don't Read Math -- DO Math

Homework via Blackboard

• Homework

Chapter 1

• Propositional Logic
• Applications of Propositional Logic
• Propositional Equivalences
• Predicates and Quantifiers
• Nested Quantifiers
• Rules of Inference
• Introduction to Proofs
• Proof Methods and Strategy One
• Proof Methods and Strategy Two
• Proof Methods and Strategy Three
• Open Problems and Exam 1 Review

Chapter 2

• Sets
• Set Operations
• Functions
• Special Functions, Sequences, and Summations
• Summations and Cardinality of Sets
• Cardinality of Sets (continued)
• Computability and Matrices
• Student Questions and Exam 2 Review

Chapter 4

• Divisibility and Modular Arithmetic
• Modular Arithmetic and Integer Representations
• Integer Operations and Primes
• Primes, Sieves, GCD, and LCM
• Euclid's Algorithm and Cryptography Intro
• Private Key and Public Key Cryptography

Chapter 5

• Weak and Strong Induction
• Induction Examples
• Strong Induction, Recursive Definitions, and Structural Induction
• Questions and Exam 3 Review

Chapter 6

• Basics of Counting
• Pigeonhole Principle
• Permutations and Combinations
• Binomial Theorem

Chapter 8

• Applications of Recurrence Relations
• Linear Homogeneous Rec Rel (Part 1)
• Linear Homogeneous Rec Rel (Part 2)
• Questions and Exam 4 Review

Final Exam Review

• Video of Review with PDF file