MA 293 - Fall 2001 - Home Page
Click HERE to see course syllabus (in HTML).
Click HERE to see course syllabus (in MS-Word format).
Click HERE to see course syllabus (in Adobe PDF format).
Extra Office Hours next week!
M-F 3-5
Important Dates
Days Off
- Monday October 8 (substitute monday on October 9!)
- Wednesday November 21 - Friday November 23
Exams
- Exam 1 - Friday October 12
- Exam 2 - Friday November 16
- Final Exam - Saturday December 15 - [12:30 - 2:30]
Homework Assignments (Non turn-in)
Week 1
- Wed, Sep. 5
- 1.1 & 1.2: 1,3,9,13,17,21,33
- Fri, Sep. 7
Week 2
- Mon, Sep. 10
- Wed, Sep. 12
- 1.3: 23,25,29,33
- Turn in #1
- Look here to see a sample program that computes binomial coefficients.
- Fri, Sep. 14
Week 3
- Mon, Sep. 17
- Ch. 1 Supplementary Exercises: 1,5,7,11,13,23
- Wed, Sep. 19
- Fri, Sep. 21
Week 4
- Mon, Sep. 24
- Wed, Sep. 26
- Fri, Sep. 28
- 2.4: 1,3,7,9,21
- Recall our discussion of the following situation:
- p(x)="x is a prime number"
- q(x)="2x-1 is a prime number" (Such a prime is called a Mersenne prime.)
- We observed that for some x, p(x)->q(x) but not all.
- As to the converse, q(x)->p(x), it turns out that this is true for all x
- Here is a demonstration of this fact.
Week 5
- Mon, Oct. 1
- Ch. 2 - Supplementary Exercises: 1,7,13
- Wed, Oct. 3
- Fri, Oct. 5
- 3.2: 1, 3, 5 (ref. P.137), 7
- Here is quick discussion of the proof that there are more real numbers in the interval [0,1] than natural numbers N.
Week 6
- Tue, Oct. 9 (Substitute Monday)
- Wed, Oct. 10
- Fri, Oct. 12
Week 7
- Mon, Oct. 15
- 3.3/3.4 (P.156) # 1,3,5,9
- Wed, Oct. 17
- Turn in #5
- Ch. 3 - Supplementary Exercises: 1,7,9,11
- Fri, Oct. 19
Week 8
- Mon, Oct. 22
- Using the product rule and induction, show that d/dx (f(x))n = n(f(x)){n-1}f '(x) for
all positive integers n.
- Wed, Oct. 24
- Fri, Oct. 26
Week 9
- Mon, Oct. 29
- Wed, Oct. 31
- Fri, Nov. 2
- Ch. 4 - Supplementary Exercises: 1,3,5,7
Week 10
- Mon, Nov. 5
- Wed, Nov. 7
- Fri, Nov. 9
Week 11
- Mon, Nov. 12
- Wed, Nov. 14
- Fri, Nov. 16
Week 12
- Mon, Nov. 19
- Wed, Nov. 21
- Fri, Nov. 23
Week 13
- Mon, Nov. 26
- Wed, Nov. 28
- 5.7 # 1 (a,c,f), 3
- Ch. 5 - Supplementary Exercises: 1,3,5,11(a),26
- Turn in #9
- Fri, Nov. 30
Week 14
- Mon, Dec. 3
- Wed, Dec. 5
- Fri, Dec. 7
Week 15
- Mon, Dec. 10
Homework Assignments (Turn In!)
- #1. Assigned - Wed. Sep. 12 (Due Fri. Sep. 14)
- #2. Assigned - Wed. Sep. 19 (Due Fri. Sep. 21)
- 1.4 #18 (P.35) - Note, we want x1+x2+x3=6 AND x1+x2+x3+...+x7=37 SIMULTANEOUSLY!
- #3. Assigned - Wed. Sep. 26 (Due Fri. Sep. 28)
- #4. Assigned - Wed. Oct. 3 (Due Fri. Oct. 5)
- #5. Assigned - Wed. Oct. 17 (Due Fri. Oct. 19)
- #6. Assigned - Wed. Oct. 24 (Due Fri. Oct. 26)
- 4.1 #2 (b) Show all work!
- #7. Assigned - Wed. Oct. 31 (Due Fri. Nov. 2)
- 4.3 #10
- This question asks you to prove that if n>1 is odd, then 8|(n2 -1)
- Now this can be proven in two ways
- (a) Induction together with the fact that any odd integer is of the form 2k+1 for some integer k.
- (b) Realizing that any odd integer can be written in either the form 4k+1 or 4k+3 for some integer k.
- #8. Assigned - Wed. Nov. 7 (Due Fri. Nov. 9)
- #9. Assigned - Wed. Nov. 28 (Due Fri. Nov. 30)
- #10. Assigned - Wed. Dec. 5 (Due Fri. Dec. 7)
Miscellany (Look here for additional materials!)
Click here to download a Perl script that computes binomial coefficients.
Click here for the answer key to the first exam.
Click here for the answer key to the second exam.