Instructor: Dr. Kathryn Truman
Office: Math Building 1113
Email: rendke (at math dot umd dot edu)
| Course Info: | Spring 2012 |
| MWF 10:00-10:50 | |
| MTH B0421 |
Office Hours: 9:30-9:55 MWF or by appointment
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 theoretical 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 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 9 of Fitzpatrick.
| Mini-Exam: | Chapters 0-2 | February 8 |
| Exam 1: | Chapters 3-6 | February 29 |
| Exam 2: | Chapters 7-10, PHP | March 30 |
| Exam 3: | 12.1 of Chartrand and Chapters 1-2 of Fitzpatrick | April 20 |
| Exam 4: | Chapters 2-3 Fitzpatrick | May 7 |
Grading:
| One in-class Mini-Exam (50 pts) | 50 pts |
| Four in-class Exams (75 pts each) | 300 pts |
| 16 Homeworks (20 pts each) | 260 pts (drop 3) |
| 16 Quizzes (10 pts each) | 140 pts (drop 2) |
| Final (Exam | 150 pts |
| Total | 900 pts |
As per the new University illness policy, if you miss a class due to illness, you must make a reasonable effort to contact me prior to class and provide me with a note signed by you detailing the date and reason for absence at the next class attended. If you miss more than two classes or an exam you will be required to provide a documentation signed by a health care professional.
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). Recently, the solutions manual has been available to download online, though 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 (which may on occasion include a book problem or two). The problem sets will be handed out in class and appear on the class website in PDF format. All problems from the collected set must be turned in, but only selected questions will be graded (for correctness). The questions must be done in order and no more than two problems per side of each page. (So no more than 4 per page.) Each page must include your name and it would be best to staple your pages together. Even though I will not collect book problems, I will expect that you understand them for quizzes and exams. All odd problems have solutions in the back of the text. 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.
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 |
| 1.1, 1.5, 1.7, 1.11, 1.19, 1.41, 2.1, 2.3, 2.5, 2.8 | Hwk1 | January 30 |
| 2.11, 2.17, 2.19, 2.23, 2.33, 2.37, 2.39, 2.45, 2.49 | Hwk2 | February 3 |
| 3:1; 3:5; 3:7; 3:11; 3:12; 3:20; 3:27; 3:28; 3:29; 3:30; 3:33; 3:39 | Hwk3 | February 13 |
| 4:3; 4:5; 4:7; 4:19; 4:25; 4:55; 4:66; 4:68; 5:1; 5:11; 5:13; 5:15; 5:32; 5:33; 5:36; 5:43; 5:45; 5:46 | Hwk4 | February 17 |
| 4:27; 4:33; 4:34; 4:37; 4:61; 4:64; 5:32; 5:33; 5:36; 5:38; 5:41; 5:43; 5:45; 5:46 | Hwk5 | February 22 |
| listed on the pdf | Hwk6 | March 5 |
| 7.20, 7.22, 7.26, 7.27, 7.31, 7.39, 7.42, 7.48, 7.50, 7.54, 7.60, 7.61, 8.3, 8.5, 8.9, 8.15, 8.16, 9.3, 9.5 | Hwk7 | March 9 |
| listed on the pdf | Hwk8 | March 9 |
| 9.25, 9.28, 9.29, 9.48 | Hwk9 | March 26 |
| on the pdf | Hwk10 | April 4 |
| none | Hwk11 | April 9 by 4 pm |
| none | Hwk12 | April 13 |
| none | Hwk13 | April 18 |
| none | Hwk14 | April 25 |
| none | Hwk15 | May 4 |
| none | Hwk16 | May 9 |