Instructor: Dr. Kathryn Truman
Office: Math Building 1113
Email: rendke (at math dot umd dot edu)
| Course Info: | Fall 2010 |
| MWF 12:00-12:50 | |
| Room 0405 (Math Bldg) |
Office Hours: TBA
Text: Mathematical Proofs by Chartrand, Polimeni and Zhang, 2nd edition
Recommended: Advanced Calculus by Fitzpatrick, 2nd edition, AMS (this is the text for Math 410)
Prerequisite: Math141
Corequisite: Math241. Please note that Math240 is also a prerequisite for Math410.
Course Description:
Math310 is designed to be a lead in course to Math410 (Advanced Calculus). The goal
is to introduce you to introductory theory material and review some calculus with proof, so
that you will be able to succeed in Math410. The majority of the course will be spent on
introducing the theory of mathematics. You will learn different methods of proof and how
to apply each technique to different situations. This course should not only prepare you for
Math410, but also prepare you to study theoretical mathematics in any area. Approximately
one third of the course will be spent reviewing some introductory calculus material with
proof. We will discuss sequences and continuity in more detail as well.
You will be expected to read, understand and do
proofs in this course. If you are not yet comfortable with proofs you
will be by the end of the semester. To really learn mathematics you need
to do mathematics, so you will be expected to work on problem sets. You
should also read the material from the text before each class. For a
description of the material to be covered see the math department's course
syllabus here.
The syllabus I handed out in class (in PDF format) is here.
Rough Schedule: We will cover Chapters 0 through 10 and 12 of Chartrand, Polimeni and Zhang, as well as parts of Chapters 1, 2 and 3 of Fitzpatrick.
| Exam 1: | Chapters 0-3 |
| Exam 2: | Chapters 4-6, PHP |
| Exam 3: | Chapters 7-10 |
| Exam 4: | 12.1 of Chartrand and Chapters 1-2 of Fitzpatrick |
| Exam 5: | Chapters 2-3 Fitzpatrick, 12.5 Chartrand |
Grading:
| Five in-class Exams (75 pts each) | 375 pts |
| Weekly Homework (20 pts each) | 220 pts |
| Weekly Quizzes (15 pts each) | 180 pts |
| Final (Exam | 150 pts |
| Total | 925 pts |
You can find old exams given in this course at testbank.
Honor Code: You should be familiar with the University's policies on Academic Integrity, including the Honor Pledge. In this course: you are cheating on homework if you copy someone else's work. It is fine to have someone explain a problem to you, or show you her work; you just have to write a solution from your own understanding, without simply copying. Copying does not benefit you, as you are unlikely to be able to reproduce the answer on a quiz or exam. Homework is a very important part of this course, but your overall understanding is more important.
Homework Assignments:
I encourage you to work in groups on the homework assignments. Homework will be assigned daily, and collected approximately weekly (or slightly more frequently.) Exam and Quiz questions will be similar if not identical to homework questions. Quizzes will be on the day following homework collection date (on the homework collected) and days before exams (on all material since the last exam). Recently, the solutions manual has been available to download online, however, probably not legally. Because of this you will have two types of problems assigned, textbook problems - not collected - and a set of questions I make up that I will collect from (which may on occasion include a book problem or two also.) The problem sets will be handed out in class and appear on the class website in PDF format. I will not specify in advance which of the problems from the ``collection set'' I will collect. For this reason each problem must be done on a separate page (or half page) and you must include your name on each page (or half page). Even though I will not collect book problems, I will expect that you understand them for quizzes and exams. So, you should only look at the solutions if you are really stuck and try to only look as far into the solution as you need. All odd problems have solutions in the back of the text.
I reserve the right to give unannounced quizzes and make changes in the syllabus
that I feel are necessary. Any changes in the syllabus will be announced in class and posted to the website.
| Book Problems | "Collected Set" | Due Date |
| Read Chapter 0 (Quiz Sept 3), 1.1, 1.5, 1.8, 1.9, 1.10, 1.19, 1.21, 1.41, 1.52, 2.1, 2.2, 2.3, 2.5, 2.8 | Hwk1 | Sept 3 |
| 2.10, 2.11, 2.14, 2.15, 2.19, 2.23, 2.28, 2.31, 2.33, 2.34, 2.37, 2.38, 2.40, 2.41, 2.45, 2.46, 2.49. 2.57 | Hwk2 | Sept 13 |
| 3.1, 3.5, 3.7, 3.11, 3.12, 3.15, 3.18, 3.20, 3.21, 3.23, 3.27, 3.28, 3.29, 3.30, 3.32, 3.39 | Hwk3 | Sept 17 |
| 4.3, 4.4, 4.7, 4.18, 4.19, 4.20, 4.25, 4.31, 4.33, 4.37, 4.52, 4.54, 4.60, 4.62, 4.68 | Hwk4 | Sept 27 |
| 5.1, 5.6, 5.11, 5.13, 5.16, 5.21, 5.23, 5.27, 5.32, 5.33, 5.36, 5.43, 5.45, 5.46 | Hwk5 | Oct 1 |
| 6.8(b), 6.11, 6.15, 6.19, 6.21, 6.38 | Hwk6 | Oct 6 |
| Sect 7.4 'Quiz', 7.1, 7.4, 7.7, 7.8, 7.12, 7.16, 7.19, 7.22, 7.27, 7.31, 7.39, 7.42, 7.47, 7.49, 7.54, 7.66, 7.68, 7.71, 7.76 | Hwk7 | Oct 18 *Quiz 10/18 also* |
| 8.3, 8.4, 8.5, 8.9, 8.12, 8.15, 8.16, 9.3, 9.4, 9.6, 9.11, 9.13, 9.17, 9.21, 9.43 | Ch8 Hwk8 | Oct 22 |
| 9.25, 9.26, 9.30, 9.37, 9.46, 9.48, 9.52 | Hwk9 | Oct 27 |
| none | F: 1.1 #2, 11, 13, 14,; 1.2 #1, 3, 5, 6, 7; 1.3 #8, 14, 15 | Nov 8th |
| C: 12.1-12.7, 12.31-12.34, 12.37, 12.39, 12.40 | Hwk11 | Nov 10th |
| none | F: 2.1 #1, 6, 7, 8, 9, 11, 17 | Nov 12th |
| none | F: 2.2 #1, 2, 5 Hwk12 | Nov 15th |
| none | F: 2.3 #1, 3, 8 Hwk13 | Nov 24th |
| none | F: 2.4 #1, 2, 7, 8 Hwk14 | Nov 29th |
| none | F: 3.1 #1, 7, 8, 11 Hwk15 | Dec 3rd |
| 12.11, 12.15, 12.17, 12.25, 12.26, 12.35 | F: 3.5 #1, 2, 3, 4 Hwk16 | Dec 6th |