CS 301 Fall 2012 Problem Set 1
This assignment is a review of set notation, etc..., and is easier than future assignments.
In the Sipser text :
Exercises: 0.3, 0.4, 0.5, 0.6, 0.7.
Problems: Sipser text Problem 0.12 (0.11 in 2nd edition), and the following:
Prove using induction that
\sum_{m=0}^nm=\frac{n(n+1)}{2}.
-- Main.gharibian - 2012-08-24
Topic revision: r2 - 2012-08-24 - 23:59:10 - Main.sggharib