Course description
Logic, sets, functions, elementary number theory and combinatorics, recursive algorithms, and mathematical reasoning, including induction. Emphasizes connections to computer science.
Enrollment requirements
Pre-requisite(s): MAT 210, 251, 265, or 270 with C or better; minimum sophomore standing
Syllabus
Example Syllabus (this may not be the syllabus used by your instructor, but gives students an idea of the course content and expectations).
Review files
Video and powerpoint resources
MAT 243 Video links
MAT 243 Online Lecture Powerpoints
- Propositional Logic
- Propositional Equivalence
- Predicates and Quantifiers and Nested Quantifiers
- Rules of Inference
- Proofs
- Sets
- Set Operations
- Functions
- Sequences and Summation
- Growth of Functions - Introduction
- Growth of Functions - Full Theory
- Divisibility and Modular Arithmetic
- Integer Representations
- Primes
- Induction
- Recursive Definitions and Structural Induction
- Counting and the Pigeonhole Principle
- Permutations and Combinations
- Permutations and Combinations Add-on 6502 Assembly Example
- Binomial Theorem
- Inclusion-Exclusion
- Probability
- Solving Linear Recurrence Relations
- Relations
Course Coordinators: Ileana Ionascu, Hedvig Mohacsy, Neha Joshi
Online: Hedvig Mohacsy, Rochus Boerner