FALL 2008 MATH 301/0101
Introduction to Mathematical Analysis I
Instructor: Dr Muruhan Rathinam
Lectures - time and location:
MWF 11:00 - 12:05 PM, MP102
Office hours:
M 4-5, W 1-2; and/or by appointment.
Office location:
Math/Psychology Rm 433.
Contact info:
410-455-2423 muruhan@math.umbc.edu.
Text book: Required.
Real Analysis, Bartle and Sherbert, 3rd Edition.
Click here to down load detailed course information handout
Final exam: Dec 12th Friday 10:30-12:30 MP102
CURRENT INFORMATION
Exam 1:
will be held in class on Wed Oct 15th.
All of chapter 1 and 2 material covered in class may be tested.
Open book and closed notes.
No calculators allowed. Time: entire duration of the lecture hour 11-12:05.
Homework 6:
Due in class on Mon Oct 13th.
Sec 3.1: 4, 5(b), 5(d), 8, 10, 17. (NOTE: for 4 and 5 need epsilon-K proofs.)
Sec 3.2: For this section, you may use limit theorems when appropriate. 1(b), 1(d), 2, 4.
Free tutoring for Math 301!
Available on Fridays 12noon - 1pm in the Math Lounge - MP422.
Homework 5:
Due in class on Mon Oct 6th.
Sec 2.1: 19.
Sec 2.2: 15.
Sec 2.3: 2, 5, 8, 10.
Sec 2.4: 3, 4, 6, 18.
PAST INFORMATION
Homework 4:
Due in class on Fri Sep 26th.
Sec 2.1: 8, 14, 18, 24.
Sec 2.2: 2, 4, 5.
Quiz 1:
will be held in class on Wed Sep 24th.
All chapter 1 material covered in class may be tested. Closed book and closed notes.
No calculators allowed. 30 mins duration.
Homework 3:
Due in class on Fri Sep 19th.
Sec 1.3: 4 (you must prove that this is a bijection).
This question is not from the book: Exhibit (define) a bijection from the set of even integers
onto the set of odd
natural numbers.
Prove that what you have defined is a bijection.
Sec 2.1: 1(b), 1(d), 2(b), 2(d), 3(b,c), 4, 5.
You are allowed to use previously solved problems. For example
to do 2(d), you can use 1(b), 1(d) etc. You can also use 1(a), 1(c)
as they are solved in the back of the book.
Homework 2:
Due in class on Fri Sept 12th.
Sec 1.1: 4, 8 (prove your answers), 14, 17(a), 17(b), 20(b).
Sec 1.2: 3, 7, 14, 20.
Homework 1:
Due in class on Fri Sep 5th.
Q1: Using the truth table show that
"not(P or Q)" is equivalent to "(not P) and (not Q)".
Q2: Using the truth table show that
"P and (Q or R)" is equivalent to "(P and Q) or (P and R)".
Q3: Using the truth table show that
"((P<=>Q) and (Q<=>R)) => (P<=>R)" is always true.
Q4 and Q5 are from the text book.
Q4: Sec 1.1: Ex1 (Follow the hint in the back of the book).
Q5: Sec1.1: Ex 3 (You may use the results of Q1 and/or Q2).