Math 262 Lectures

Spring 2014


Date Section Lecture Topic Due
Chapter 2: The Logic of Compound Statements
Wed, Jan 15 Sec 2.1 1 Logical Forms  
Thu, Jan 16 Sec. 2.1 2 Logical Equivalence  
Fri, Jan 17 Sec. 2.2 3 Conditional Statements  
Mon, Jan 20 Sec. 2.3 4 Arguments  
Wed, Jan 22 Sec. 2.4 5 Digital Logic Circuits HW 1
Thu, Jan 23 Sec. 2.5 6 Binary Adders  
Fri, Jan 24 Sec. 2.5 7 Negative Integers  
Mon, Jan 27 Sec. 2.5 8 Integer Overflow  
Chapter 3: The Logic of Quantified Statements
Wed, Jan 29 Sec. 3.1 9 Predicates and Quantifiers HW 2
Thu, Jan 30 Sec. 3.2 10 Negations of Quantifiers  
Fri, Jan 31 Sec. 3.3 11 Multiple Quantifiers  
Chapter 4: Elementary Number Theory and Methods of Proof
Mon, Feb 3 Sec. 4.1 12 Direct Proof - Introduction  
Wed, Feb 5 Sec. 4.1 13 Direct Proof - Universal Statements HW 3
Thu, Feb 6 Sec. 4.2 14 Direct Proof - Rational Numbers  
Fri, Feb 7 Sec. 4.3 15 Direct Proof - Divisibility  
Mon, Feb 10 Sec. 4.4 16 Direct Proof - Division into Cases  
Wed, Feb 12 Sec. 4.5 17 Direct Proof - Floor and Ceiling HW 4
Thu, Feb 13 Sec. 4.6 18 Indirect Argument  
Fri, Feb 14 Test 1 (Solutions)  
Mon, Feb 17 Sec. 4.8 19 Algorithms  
Chapter 5: Sequences and Mathematical Induction
Wed, Feb 19 Sec. 5.1 20 Sequences HW 5
Thu, Feb 20 Sec. 5.2 21 Mathematical Induction - Introduction  
Fri, Feb 21 Sec. 5.3 22 More Mathematical Induction  
Mon, Feb 24 Sec. 5.4 23 Strong Mathematical Induction  
Wed, Feb 26 Sec. 5.6 24 Recursive Sequences  
Thu, Feb 27 Sec 5.7 25 Solving by Iteration HW 6
Fri, Feb 28 Sec 5.8 26 Linear First-Order Equations  
Mon, Mar 3 Sec 5.8 27 Linear Second-Order Equations  
Chapter 6: Set Theory
Wed, Mar 5 Sec 6.1 28 Introduction to Sets HW 7
Thu, Mar 6 Sec 6.2 29 Properties of Sets  
Fri, Mar 7 Sec 6.3 - 6.4 30 Boolean Algebras  
Chapter 7: Functions
Mon, Mar 17 Sec 7.1 31 Functions  
Wed, Mar 19 Sec 7.1 32 Functions and Relations HW 8
Thu, Mar 20 Sec 7.2 33 Properties of Functions  
Fri, Mar 21 Test 2 (Solutions)  
Mon, Mar 24 Sec 7.3 34 Composition of Functions  
Chapter 6: Counting and Probability
Wed, Mar 26 Sec 7.4 35 Cardinality HW 9
Thu, Mar 27 Sec 7.4 36 Uncountable Sets  
Chapter 8: Relations
Fri, Mar 28 Sec 8.1 37 Relations on Sets  
Mon, Mar 31 Sec 8.2 38 Reflexivity, Symmetry, Transitivity  
Wed, Apr 2 Sec 8.3 39 Equivalence Relations HW 10
Thu, Apr 3 Sec 8.3 40 Equivalence Relations  
Fri, Apr 4 Sec 8.5 41 Partial Orders  
Mon, Apr 7 Sec 9.1 42 Total Orders  
Chapter 9: Probability
Wed, Apr 9 Sec 9.1 43 Counting and Probability HW 11
Thu, Apr 10 Sec 9.2 44 The Multiplication Rule  
Fri, Apr 11 Sec 9.3 45 The Addition Rule  
Mon, Apr 14 Sec 9.4 46 The Pigeonhole Principle  
Wed, Apr 16 Sec 9.5 47 Combinations HW 12
Thu, Apr 17 Sec 9.7 48 The Binomial Theorem  
Fri, Apr 18 Sec 9.8 49 Probability  
Chapter 11: The Efficiency of Algorithms
Mon, Apr 21 Sec 11.2 50 Omega Notation  
Wed, Apr 23 Sec 11.4 51 Relations on a Set HW 13
Thu, Apr 24 Sec 11.3 52 Efficiency of Algorithms  
Fri, Apr 25 Sec xxx 53 TBA  
Mon, Apr 28 xxx 53 TBA  


URL: http://people.hsc.edu/faculty-staff/robbk/Math262/Syllabus/Syllabus.html
This web page is maintained by Robb T. Koether
Return to the Math 262 home page