Massachusetts Institute of Technology	Spring 1998
6.042J/18.062J: Mathematics for Computer Science	Professor Albert R. Meyer

For questions about problem sets and other course material, try email to 6042-help@theory.lcs.mit.edu.

• Review Problem Set 11

  • H59: Pset11 and Soln (ps).
  
  

• Problem Set 10

  • H49: Problem Set 10 (ps).
  • H55: Pset10 Soln(ps).
    • 5/5/98
      Typos in problem 6 solution
  
  

• Problem Set 9

  • H45: Problem Set 9 (ps).
  • H48: Pset9 Soln(ps).
  
  

• Problem Set 8

  • H41: Problem Set 8 (ps).
    • Problem 4(c) replaced by new Problem 4(c),(d).
    • Reading assignment added.
  • H44: Pset8 Soln(ps).
    • (revised 4/15) Typos in Prob 5 soln corrected.
  
  

• Problem Set 7

  • H35: Problem Set 7 (ps).
  • H40: Pset7 Soln(ps).
  
  

• Problem Set 6

  • H30: Problem Set 6 (ps).
  • H36: Pset6 Soln(ps).
  
  

• Problem Set 5

  • H20: Problem Set 5 (ps).
  • H25: Pset5 Soln(ps).
  
  

• Problem Set 4

  • H15: Problem Set 4 (ps) 3/2/98
    • Correction in problem 4(f): you must assume that that there are an equal number of men and women.
    • Correction to the example in problem 3: the set of ``bounded'' moves is {(1,1), (1,2), (2,1), (0,3), (0,2), (0,1), (0,0), (1,0), (2,0), (3,0)}. The ``unbounded'' moves in the example are the points with at least one zero-coordinate, except the 7 above.
  • H21: Pset 4 Solution (ps).
  
  

• Problem Set 3

  • H11: Problem Set 3 (ps)
    
  • H16: Pset 3 Solution (ps).
  
  

• Problem Set 2

  • H06: Problem Set 2 (ps) corrected 2/11/98.
  • H12: Pset 2 Solution (ps) :
    
    • (revised 2/27) The false proof in Problem 6b is revised to be even more convincing.
  
  

• Problem Set 1

  • H03: Problem Set 1 (ps)
  • H08: Pset 1 Solution (ps).