Math 103, Fall 2007
Assignment for September 27-October 01:
1. Read Pages 11-27 of the textbook.
2. Make a (hand-written) list of all definitions given in chapter 2. You must turn in this (Definitions) list along with your solution to Homework 1 problems.
3. Make a (hand-written) list of all theorems (including lemmas, propositions, corollaries) given in chapter 2 without proof. You must turn in this (Theorems) list along with your solution to Homework 1 problems.
4. Read the entries in your Theorems List try to reproduce the definition of each technical term appearing in these theorems without referring to your Definitions List. If you fail to remember a definition look it up and then start over from the top of your Theorems List. Continue until you could remember the definition of all the technical terms appearing in your Theorems List.
5. Give a proof of every entry in your Theorems List starting from the top of your list and without referring to the book or your lecture notes. If you fail to prove a theorem look it up in the book and then start over proving the theorems in your list. After a few trials you should be able to produce the proofs of all the theorems in your Theorems List.
Homework 1 (Due on Oct. 02, 09:30 am):
1 (10 points): Make a (hand-written) list of all definitions given in chapter 2.
2 (20 points): Make a (hand-written) list of all theorems, lemmas, propositions, corollaries given in chapter 2.
3 (70 points): Solve problems 2.1, 2.3, 2.5, 2.6, 2.8, 2.10, 2.11 on pages 21-22 of the textbook.
Note: The minimum of your grade in this homework set and in Quiz 1 will contribute about 4.5 points out of 100 to your total numerical grade in this course.
Policy for Homeworks: Homeworks will be collected in class. The assistants will not accept late homeworks nor will they return them directly to the students. If a student fails to turn in his (her) homework by the deadline, his (her) grade for that homework set will be reduced by 10 points (out of 100) for each day passed the deadline.