MA 3053 - Schedule
 

 

Home
Syllabus
Schedule
Links
 
Homework
 

 

 

 

 

 

 

 

 

 

 

 

Schedule

Schedule of topics: MA 3053, Fall 2015

Date Section       Description 
Aug 18      1.1, 1.2 Introduction, basic logic and set notation
Aug 20 1.2 Set equality and inclusions

Aug 25 1.2 Operations on sets
Aug 27 (class cancelled due to campus incident)

Sep 1 1.3 Functions, definition and examples
Sep 3 1.3 Graphs of functions; operations

Sep 8 1.4 Injections, surjections, and bijections
Sep 10 1.5 Images, preimages, and inverse functions

Sep 15 1.6 More on preimages, sequences
Sep 17 Exam 1

Sep 22 1.7 Russell's Paradox, relations
Sep 24 2.1 Relations properties and examples

Sep 29 2.2 Partial order relations
Oct 1 2.3 Equivalence relations

Oct 6 Fall break! (No class)
Oct 8 2.4 Partitions <-> equivalence relations, bijections from quotient space

Oct 13 2.5 Modular arithmetic is well-defined
Oct 15 2.5 Modular arithmetic examples and applications

Oct 20 3.2 Atomic and compound statements: ¬ ∧ ∨ ⇒, truth functions
Oct 22 3.2 - 3.3 Implications, mathematical formulas

Oct 27 3.4 Introduction to quantifiers: ∀, ∃
Oct 29 3.4 - 3.5 Quantifier order and negation, proof strategies

Nov 3 3.5 More proof strategies
Nov 5 Exam 2

Nov 10 4.2 How to use mathematical induction
Nov 12 4.1 - 4.2 Induction examples, why induction works

Nov 17 4.2 A cautionary tale (all chalk is white), strong induction
Nov 19 5.1 Limit definitions and examples

Nov 24 5.1 The Limit Omnibus Theorem
Nov 26 Thanksgiving! (No class)

Dec 1 6.1 A short introduction to cardinality

Dec 7 Final exam   (12:00 — 3:00pm)

Print-friendly version. (Opens in a new window.)