HW Math 3411

Math 3411's HW page

  1. Hw due Tue, Sept 1: 1.1, pg 7: #18,22,23,24,28,33,38,39,48,50. (We have done 1-12 in class.)
  2. Hw due Thur, Sept 3: 1.2, pg 16: #17,21,26,30,36,41,47,50,54.
  3. Hw due Tue, Sept 8: 1.3: #37,38; and 1.4: #36-39 (on 39, answer relative to 36-38), 53-55.
  4. Hw due Thur, Sept 10: 1.5, pg48: #11,17,26,29,35,37,45.
  5. Hw due Tue, Sept 15: From Handout 1 on Mathematical Induction : Problems 1 (all parts); 2, 3(a,b,c); 4(b); pg 61 #22.
  6. Hw due Thur, Sept 17: 2.1, pg 96: #24,37,42,54,72,73,75,76,80,94.
  7. Hw due Tue, Sept 22 : 2.2, pg 111: #7,17,24,27,39,54,58,62,72.
  8. Hw due Thur, Sept 24: 2.3, pg 121: #8,10,18,20, 76-81, 84-86, 110,112,114, 119.
  9. Hw due Thur, Oct 1: 3.1, pg 140: #11,14,19-24,27,30,31,38,40,41,43.
  10. Hw due Tue, Oct 6: 3.2, pg 146: #1,5,20,21,29,30,43, 54, 48(bonus).
  11. Hw due Thurs, Oct 8: 3.3, pg 153: #1,2,5,9,10,13,17,20.
  12. Hw due Thur, Oct 15: 4.1, pg 175: #3, 9-12, 39,49,53,54.
  13. Hw due Thurs, Oct 22: 4.2, pg 188: # 12,13,17,20,22,28,34,35,43,45.
  14. Hw due Tue Oct 27: Numerical sol to discrete dynamical systems *
  15. Hw due Thur Nov 5: Problems 1 through 14 from Handout 4 on Counting Process and Classical Combinatorics.
  16. Hw due Tue Nov 10: Problems 15 through 19 from Handout 4 on Counting Process and Classical Combinatorics.
  17. Hw due by noon on Fri Nov 13: Problems from graph theory
  18. Hw due Tue Nov 17: Problems from MCST and Euler tours
  19. Hw due Tue Dec 1: Problems from Shortest Path
  20. Hw due Thu Dec 3: Problems from Maximum s-t Flow
  21. A Lab Hw due &dagger date: Problems from a selection of different combinatorial optimization models * .
    This will be the last assignment of the semester.

Please note:
  1. &dagger Due dates will be announced in class as we go.
  2. All work must be shown on every problem that you turned in; you need to show the mathematical steps from the beginning to the end. If you would like to earn partial credits, you need to explain how you arrive at the answer - explain verbally, if you have to.
  3. * We will be using Mathematica and GiDeN to solve a few problems numerically or to solve a few combinatorial optimization problems numerically.

Back to Peh's Discrete & Combinatorial Math Page


Comments on this page may be sent to pehng@morris.umn.edu

This homepage is maintained by
Peh H. Ng ,
Professor of Mathematics & Math Discipline's Web Janitor
Mathematics Discipline
Division of Science and Mathematics
University of Minnesota - Morris
Morris, MN 56267
(320)-589-6318
email: pehng@morris.umn.edu

© 2001-2009 by Peh Ng
Last Modified Tuesday, November 17, 2009
Page URL: http://www.morris.umn.edu/~pehng/Ma3411/hw.html