MAT 2600-004: MWF, 11:45-12:35, John Barry Hall 208
MAT 1220-001: MW, 1:55-3:10, Chemical Engineering Building 204
Office Hours: Monday Wednesday 12:45-1:45, Tuesday Thursday by appointment
Announcements: The first exam for 1220 will be Wednesday October 8, the first exam for 2600 will be Friday October 10
Office Hours: Monday Wednesday 12:45-1:45, Tuesday Thursday by appointment
Overleaf Resources: Here is some information on how to type mathematics: overleaf primer and homework template. Both of these were generously given to me by the benevolent Dr. Kristin Heysse. Another useful guide is this blogpost by (Jeopardy! champion) Robert Won: https://blogs.gwu.edu/robertwon/2021/07/18/how-to-tex-your-homework/
List of learning objectives: 2600 first exam and 1220 first exam
Textbooks:
Math 2600: Book of Proof by Hammack and An Introduction to Proof via Inquiry-Based Learning by Ernst. Both available online for free, links on blackboard.
Math 1220: For All Practical Purposes: Mathematical Literacy in Today's World, COMAP, eleventh edition. You will need an access code to Achieve to do the homework.
Week 1: introduction, beginning propositional logic, direct proof.
Definitions you should know: even, odd, statement, set, real numbers, integers, natural numbers, and, or, not, conditional statement
Useful reading: Hammack sections 2.1-2.3 and 4.3, Ernst Chapter 1, sections 2.1-2.3
Week 2: divisibility and the division algorithm, more direct proof, using cases. Homework 1 due Friday.
Definitions you should know: divisible by/multiple of, upper and lower bound
Useful reading: Hammack: 2.3, 4.1-4.4
Week 3: De Morgan's laws, proof by contrapositive, modular arithmetic, biconditional statements. Homework 2 due Friday.
Definitions you should know: converse, biconditional statement, logically equivalent, contrapositive, congruent modulo n, prime, composite
Useful reading: Ernst 2.2 and 2.3, Hammack 2.4, 2.5, 2.6, 5.1
Week 4: quantifiers, negating statements with quantifiers, proof by contradiction. Homework 3 due Friday.
Definitions you should know: greatest common divisor, rational/irrational
Useful reading: Hammack 2.7, 2.10, chapter 6, Ernst 2.4 and 2.5, Chapter 6
Week 5: Proof by induction. Homework 4 due Friday.
Definitions you should know: base case and inductive hypothesis
Useful reading: Hammack 10.1, Ernst 4.1 and 4.2
Week 6:
Week 7: First exam, Friday October 10
Week 1: Section 1.1: introduction, graph theory introduction, Euler circuits
Week 2: Section 1.2: Euler circuit theorem
Week 3: Section 1.3 and 1.4: Eulerizing a graph, the Chinese postman problem. Chapter 1 homework due Friday.
Week 4: Sections 2.1-2.3: Hamilton paths/circuits, the traveling salesman problem, greedy algorithms. Written Homework 1 due Monday.
Week 5: Sections 2.3 and 2.4: nearest-neighbor algorithm and sorted-edges algorithm. Minimum cost spanning trees and Kruskal's algorithm. Written Homework 2 due Wednesday.
Week 6: Section 2.5: Critical-path analysis
Week 7: review, First exam Wednesday October 8
Homework 1 problem set : Due Friday September 5 with presentations
Homework 2 problem set : Due Friday September 12 with presentations
Homework 3 problem set : Due Friday September 19 with quiz
Homework 4 problem set : Due Friday September 26 with presentations
Homework 5 problem set : Due Friday October 10
Homework 0: Testing Achieve. Due Friday August 29
Achieve Homework 1: Chapter 1 homework due Friday September 12
Written Homework 1: graph theory written assignment due Monday September 15
Written Homework 2: traveling salesman assignment due Wednesday September 24
Achieve Homework 2: Chapter 2 homework due Wednesday October 8