Homework Assignments

Math 52C

Professor Jonathan Sands
Fall 2009
 

" Do not burden the mind with memorization, but learn to think"
-Wiliam Ellery Channing


  • First drafts of Homework will be due on Mondays at the beginning of class, and Final drafts on Wednesdays at the beginning of class..
  • If you have questions, you can contact me using email: sands@cems.uvm.edu
  • In addition to the problems from the text listed below, there will sometimes be an extra problem handed out.

  •  #  Due (1st Draft)  Assignment             Comments
      1   Sept. 14 p. 8 # 1,3,6,8,14,16,22 1.2 Integers and the Division Algorithm 
      2  Sept. 21
    p. 8 #  12, 17, 19, 21, 30abc
    Problems from class
    1.2 Euclidean Algorithm
    1.4 Practice writing proofs and counterexamples.
      3  Sept. 28 p. 21 # 2,8,9,10,11,14,17
    Additional problems
    1.5 Logic
      4  Oct. 5 Problem sheet
    Solutions
    Set theory
    (Note Holiday October 9)
      5  Oct. 19
    p. 29 #1,2,3,4,6,9,10
    p. 29 # 12, 14,15  Solutions
    1.6 Relations (Test to here on Oct. 14)
    1.6 Functions 
      6   Oct. 26 p. 47 #2, 15, 17, 19, 32  Solution to #17 2.1 Induction Template for proof by induction.
      7    Nov. 2
    p. 52 #2, 3, 4, #6-Writing Assignment
    Solution to #4b
    2.2 Recursion
      8   Nov. 16
    p. 63 #5cd,17,19ad
    p. 68 #5,6,7,9,11 and  p. 47  #17
    Writing Assignment- due Nov 20
    3.1 Extended Euclidean Algorithm (Test on 11/11/09) Practice Test Solutions
    3.2 Modular Arithmetic
    Explaining Sandzini's Trick of remainders when dividing by 9.
      9   Nov. 23 p. 72 # 2, 6, 9, 10 3.3 Properties of Modular Arithmetic
     10
     Nov. 23-Dec. 9 Class presentations .

      Dec. 17 Final Exam at 3:30 .