Math. 311                                         Spring 2000

                     HOMEWORK SUMMARY REPORT


  Assignment number: 2         
    
  Problem number:  2.2.11

  Number of papers received: 2  

  Reviewing committee (Greek letter): 
     Prof. Fulling (replacing nonexistent group delta)      

  List all participating members:



  Author[s] of paper[s] chosen for publication:       
     Kurtis Williamson, Kyle Brady           




  Comments:  Both papers are worthy, though neither is perfect.  Kurtis's
is more complete, but hand-written.  Kyle's is carefully typed for the Web
but does not have enough verbal explanation; also, he didn't finish part
(a), presumably because of misreading the problem.

Both authors correctly discerned the patterns that enable one to answer
parts (c) and (d) for all values of n.  But neither gave a solid argument
for why the pattern should persist.  In part (c) a really good paper would
give a proof by mathematical induction:  Assume the answer for n, then
show that it is also true for n+1.  In (d) a formal mathematical induction
is not necessary, but one should say that it is obvious that in the nth
power of a diagonal matrix, each diagonal element will just get raised to
the nth power.