Intro to Abstract Math
|
There is no required textbook. All lecture notes will be posted here. For further reading I recommend An Introduction to Mathematical Thinking by Gilbert and Vanstone.
Office Hours: Mondays 4-5pm and Wednesdays 1-2pm Here is the syllabus. | ||
| Item | Date | Information |
|---|---|---|
|
Homework 1 Solutions |
Tues Sept 4 |
Course Notes What is a Theorem/Proof/Axiom ? Euclid's Elements The Pythagorean Theorem Principle of the Contrapositive Pythagoras Today = The Dot Product |
|
Homework 2 Solutions |
Thurs Sept 13 |
Course Notes Square Root of 2 and 3 Proof by Contradiction Truth Tables De Morgan's Laws Introduction to Induction Abstract Boolean Algebra |
|
Exam 1 Solutions |
Thurs Sept 20 |
Total: 24 points Approximate grade ranges: A = 21 and above B = 15-20 C = 12-14 |
|
Homework 3 Solutions |
Thurs Oct 4 |
Course Notes Definition of Z Well Ordering Principle of Induction |
|
Homework 4 Solutions |
Tues Oct 23 |
Course Notes Division With Remainder Greatest Common Divisor Euclidean Algorithm Linear Diophantine Equations Unique Prime Factorization |
|
Exam 2 Solutions |
Thurs Oct 25 |
Total: 24 points Approximate grade ranges: A = 20 and above B = 14-19 C = 10-13 |
|
Homework 5 Solutions |
Thurs Nov 15 |
Course Notes Rational Numbers Equivalence Relations Modular Arithmetic The Linear Congruence Theorem |
|
Homework 6 Solutions |
Thurs Nov 29 |
Course Notes Fermat's Little Theorem The Binomial Theorem Euler's Proof of Fermat's Little Theorem RSA Cryptosystem |
|
Exam 3 |
Tues Dec 4 | |