Wednesday, February 28

For Wednesday’s Class:

  • Please compare your Quiz #5 to the solutions and contact me if you want to discuss.
  • Please think about how to write an inductive proof that all trees on n vertices have n-1 edges.  Here is a handout with the relevant definitions and the question.  Please attempt to write a proof and bring it to class on Wednesday.  Even if you aren’t sure you are doing it right, having made the attempt will prepare you to get the most out of class.
  • Announcement:  There’s a Math Club Talk on Wednesday night.  This week it is about computational complexity:  how hard is it to compute certain things, like factoring.