|1||Wed Mar 29||Chapter 1
stop at `Functions'
|2||Fri Mar 31||Finish Chapter 1|
|3||Mon Apr 03||Chapter 2
Stop at `Elementary Proof Techniques'
|4||Wed Apr 05||Finish Chapter 2|
|5||Fri Apr 07||Chapter 3
before Proposition 3.16
|6||Mon Apr 10||Continue Chapter 3
stop at `Strong Induction'
|7||Wed Apr 12||Finish Chapter 3|
|8||Fri Apr 14||Chapter 4
stop at `Injections and Surjections'
|9||Mon Apr 17||Continue Chapter 4
stop at `Cardinality'
|10||Wed Apr 19||Finish Chapter 4||Eeverything up to here
is your midterm material.
|Fri Apr 21||No meeting that day|
|11||Mon Apr 24||Study for the midterm||Treat this meeting as a Q&A session
or as in-class office hours.
We can go over problems, I can clarify
things you think need going over again, etc.
We end as soon as you run out of questions, so
make sure you don't.
|Wed Apr 26||Midterm|
|12||Fri Apr 28||Chapter 6
stop at `The Dart Board Problem'
|13||Mon May 01||Finish Chapter 6
skip `More on Polynomials'
|14||Wed May 03||Chapter 10
`The Pigeonhole Principle'
|15||Fri May 05||Finish Chapter 10|
|16||Mon May 07||Chapter 11
stop at `Isomorphism of Graphs'
|17||Wed May 10||Continue Chapter 11
stop at `Connection and Trees'
|You'll need to have a look at
the section `Relations' on page 140
for background on equivalence relations.
|Fri May 12||No meeting that day|
|18||Mon May 15||Chapter 11
`Connection and Trees'
|We are again not meeting.
Please still do the reading to keep up.
|19||Wed May 17||Chapter 11
|20||Fri May 19||Chapter 13
`The Completeness Axiom'
|21||Mon May 22||Chapter 13
`Limits and Monotone Convergence'
|Wed May 24
Fri May 26
Mon May 29
|No meetings on those days.
I am away on the first two,
while the 29th is Memorial Day.
|22||Wed May 31||Finish Chapter 13
Study for final
|There will be some time for
a pre-exam Q&A, as before the midterm.
|23||Fri June 02||Study for the final some more||No meeting;
will have some extra office hours
during exam week.
|1||Wed Apr 05|| 1.15, 1.20, 1.24, 1.25, 1.38, 1.39, 1.50
2.9, 2.21, 2.32, 2.44, 2.49, 2.52
There is a typo in problem 1.50:
|Fri Apr 07||Patch problem 1.50:
Prove part (a) as stated originally;
Is it true that you always have equality in part (a)?
Prove your answer.
|Optional; you do not need to turn it in, but if
you do and it's correct it'll be worth 1% extra credit.
|2||Wed Apr 12||3.1, 3.2, 3.16, 3.18, 3.28
3.35, 3.41, 3.50, 3.61, 3.65
|3||Wed Apr 19||4.5, 4.10, 4.20, 4.26, 4.27
4.33, 4.37, 4.42, 4.43, 4.47
|Your homework problems up to
are midterm prep.
|Mon Apr 24||Spillover
from Apr 14 lecture
|Optional again; you do not need to turn it in, but
worth 1% extra credit.
|No hw on Apr 26
because of the midterm
|4||Wed May 03|| 6.18, 6.24, 6.28, 6.29
6.37, 6.41, 6.47
10.3, 10.5, 10.9, 10.18
|Fri May 05||Another extra problem that came up
during the May 01 lecture
|Optional and worth 2% extra credit|
|5||Wed May 10||10.28, 10.32, 10.35
11.1, 11.3, 11.5, 11.10
11.12, 11.13, 11.17
|6||Wed May 17||11.7, 11.8, 11.21, 11.28
11.29, 11.35, 11.36, 11.37
|For 11.37 you'll need the definition
of the complete bipartite graph
Kn,n from page 225.
|Fri May 19||A problem inspired by a question asked
in class on Friday, May 05
|Optional; 1% extra credit|
|7||Wed May 24||13.3, 13.4, 13.8
13.12, 13.25, 13.28
| Do not turn in!
This is un ungraded assignment, due to my being away.
It is meant as a suggestion for practice problems.
|8||Wed May 31||13.6, 13.7, 13.14, 13.21
13.34, 13.37, 13.38, 13.39