210 STUDY DOCS  2005 Sep 8  MATH 210 :  DISCRETE MATH  Dr. Luft

  Composed Functions

  Proof by Induction  --

  How to Count without Counting   (This document requires an Adobe reader.)
       To download a free Adobe reader, link to this site.  --
       To buy an Adobe writer, link to this site.  --

  Two Graph Theorems:
       Spanning Tree Algorithm
       Proof of Euler's Theorem by induction on faces