MATH 302 Lecture 9
Jump to navigation
Jump to search
« previous | Monday, September 26, 2011 | next »
Exam on Wednesday
Function Invertibility
A function is invertible if and only if it is bijective (both surjective/onto and injective/one-to-one)
Graphing A Function
Writing functions as columns and drawing arrows between them:
Ceiling and Floor
Ceiling rounds up to next integer if decimal is greater than 0
Floor rounds down (truncates decimal)
Proposition.
Proof. Let where and , thus . There are two cases:
Proof of (1). , where
Proof of (2).
Review for Exam
- Be familiar with definitions and terminology (key terms at end of each chapter 109-111)
- Homework is fair game: logic proofs, set proofs, function proofs
- Big-O, Big-Ω, Big-Θ
- Algorithms
- Quantifiers, properties and terminologies of conditionals
- Membership Tables and set theory