cr.yp.to update

New: cr.yp.to/2005-261
diff -ru .old-crypto/2005-261.html cr.yp.to/2005-261.html
--- .old-crypto/2005-261.html	2005-08-17 14:58:49.000000000 -0400
+++ cr.yp.to/2005-261.html	2005-08-22 06:52:50.000000000 -0400
@@ -3,5 +3,78 @@
 <a href="djb.html">D. J. Bernstein</a>
 <br><a href="mathmisc.html">More mathematics</a>
 <h1>MCS 261, Discrete Mathematics, Fall 2005</h1>
+<h2>22 August 2005</h2>
+The lecture is scheduled for 13:00-13:50 MWF in 118 Douglas Hall.
+Call number for registration: 12339.
+Prerequisites: Grade of C or better in Math 180,
+and grade of C or better in MCS 260 (or CS 102).
+<p>
+My office hours will be
+15:10-16:00 Monday,
+16:10-17:00 Monday,
+17:10-18:00 Monday in 410 SEO.
+<p>
+Course grades will be based entirely on examinations.
+Homework assignments will consist of textbook readings (see below)
+and practice exams.
+<p>
+<b>The textbook for this course is changing.</b>
+The old textbook was
+``Discrete mathematics with graph theory'' by Goodaire and Parmenter.
+There are two new textbooks:
+``A short course in discrete mathematics'' by Bender and Williamson,
+and ``Mathematics for algorithm and systems analysis'' by Bender and Williamson.
+<p>
+The new textbooks are available for free online
+from 
+<a href="http://www.math.ucsd.edu/~ebender">http://www.math.ucsd.edu/~ebender</a>.
+Here are the chapters of
+``A short course in discrete mathematics'':
+<ol>
+<li><a href="2005-261/bender1/contents.pdf">Table of Contents</a>
+<li><a href="2005-261/bender1/SF.pdf">Unit SF: Sets and Functions</a>
+<li><a href="2005-261/bender1/BF.pdf">Unit BF: Boolean Functions and Computer Arithmetic</a>
+<li><a href="2005-261/bender1/Lo.pdf">Unit Lo: Logic</a>
+<li><a href="2005-261/bender1/NT.pdf">Unit NT: Number Theory and Cryptography</a>
+<li><a href="2005-261/bender1/IS.pdf">Unit IS: Induction, Sequences and Series</a>
+<li><a href="2005-261/bender1/solution.pdf">Solutions</a>
+<li><a href="2005-261/bender1/index.pdf">Index</a>
+</ol>
+Here are the chapters of
+``Mathematics for algorithm and systems analysis'':
+<ol>
+<li><a href="2005-261/bender2/contents.pdf">Table of Contents</a>
+<li><a href="2005-261/bender2/CL.pdf">Unit CL: Basic Counting and Listing</a>
+<li><a href="2005-261/bender2/Fn.pdf">Unit Fn: Functions</a>
+<li><a href="2005-261/bender2/DT.pdf">Unit DT: Decision Trees and Recursion</a>
+<li><a href="2005-261/bender2/GT.pdf">Unit GT: Basic Concepts in Graph Theory</a>
+<li><a href="2005-261/bender2/solution.pdf">Solutions</a>
+<li><a href="2005-261/bender2/index.pdf">Index</a>
+</ol>
+I want to make sure that each concept covered is thoroughly understood,
+so I plan to focus on the following sections:
+<ol>
+<li>SF Section 1: sets
+<li>SF Section 2: functions
+<li>BF Section 1: Boolean functions
+<li>Lo Section 1: propositional logic
+<li>Lo Section 2: predicate logic
+<li>NT Section 1: basic facts about numbers
+<li>NT Section 2: cryptography
+<li>IS Section 1: induction
+<li>CL Section 1: counting lists with repetitions
+<li>CL Section 2: counting lists without repetition
+<li>CL Section 3: counting sets
+<li>Fn Section 1: more on functions     
+<li>Fn Section 2: permutations
+<li>DT Section 4: recursive equations
+<li>GT Section 1: graphs
+</ol>
+You should start reading SF Section 1 immediately.
+(You may find it helpful to also read CL Section 1;
+the contrast between sets and lists
+is helpful in clarifying the concept of a set.)
+As the course progresses,
+you should continue reading to keep up with the lectures.
 </body>
 </html>