MCS  236:  Relation-Based Structures
Spring 2000

Announcements:  Final is Tuesday, May 23, 10:30am, Olin 320.
 

Links:

• Find the Flaw
• Fibonacci numbers, Golden section and Golden string (R. Knott, Surrey)
• RSA Labs FAQ
• Hashing
• Prime Numbers (Peter Alfeld, U. of Utah)
• GIMPS
• The Prime Pages (Largest Mersenne Prime)
• Macalester College Problem of the Week (905:  a logic puzzle)
• Visible Euclidean Algorithm (Paul Garrett, UMN)
• Euclidean Algorithm Applet (finds gcd and linear combination) (David Sumner, SC)
• Source code for topological sorting (Stony Brook Algorithm Archive)
• Information flow security (Myers and Liskov, MIT)
• 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)