MC36
Relation-Based Structures
Spring 1999


Instructor:  Moira McDermott
Office:  Olin 313
Phone:  x7478
Office Hours:  MTR 2:00-3:00 pm, and always by appointment
Send me e-mail

Announcements:  Final is Saturday, 5/22, 10:30-12:30, Olin 321.  Open book and notes.

How to print and view postscript files (per David Wolfe)

Course Information:  html postscript

Problem Sets:

Exam 1 Solutions:  (postscript)(PDF)
Exam 2 Solutions:  (postscript) (PDF)

Syllabus
This schedule is subject to change.   Follow links to  individual weeks for details and assignments.

Week 1:  Intro, Fundamentals of Counting, Permutations
Week 2:  Combinations, Logic
Week 3:  Logic, Methods of Proof
Week 4:  Methods of Proof, Sets
Week 5:  Counting with Sets, Inclusion/Exclusion, Induction (Exam 1, 3/12)
Week 6:  Induction. Properties of Integers, Euclidean Algorithm (Visible Euclidean Algorithm)
Week 7:  Primes, Modular Arithmetic, Cryptography (Large Primes )(GIMPS )(RSA FAQ ) (Jabberwocky)
Week 8:  Relations, Functions
Week 9:  Pigeonhole Principle, Relations
Week 10:  Partial Orders,  (Exam 2, 4/23)
Week 11:  Equivalence Relations, Graph Theory
Week 12:  Graph Theory (topic, references due 5/3)
Week 13:  Trees (Draft 1 due 5/10, bring 2 copies)
Week 14:  Trees

Paper:

  • evaluation of internet based information(MSU)

  • Can computers prove theorems?

    Computer Math Proof Shows Reasoning Power (NYT 12/1/96)
    Corrections and Comments on above article
    Summary of results obtained with Argonne's Automated Deduction Software
    What is the best way to stack oranges? (NYT 8/25/98)

    Four Color Theorem

    Galois Theory and the Internet (NYT 2/8/99) (not really about computers proving theorems, but an interesting discussion of an application of a rather abstract mathematical idea from algebra, my personal favorite branch of math)