Read:
Appendix C, Chapters 1-4Do: Individual:
Appendix C: 1,5, extra (below)
Chapter 2: B1, C (all)
Extra: Show using strong induction that if a set S has an associative and commutative operation * then a string of operations may be
recommuted in any way, that is, it doesn't matter what order
you write the product in, so eg a*b*c*d=a*d*b*c=b*d*a*c, etc. (you may use the result from class that the string may be reassociated in any way)