HW Math 3411

Math 3411's HW page
Fall 2014

  1. Hw due Fri, Aug 29: 1.1, pg 7: #18,22,23,24,28,33,38,39,48,50. (We have done 1-12 in class.)
  2. Hw due Wed Sept 3: 1.2, pg 16: #17,21,26,30,36,41,47,50,54.
  3. Hw due Fri Sept 5:   1.3, pg 29: #37,38; and 1.4, pg 35: #36-39 (on 39, answer relative to 36-38), 53-55.
  4. Hw due Wed Sept 10: 1.5, pg48: #11,17,26,29,35,37,45.
  5. Hw due Mon 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 Wed Sept 17: 2.1, pg 96: #24,37,42,54,72,73,75,76,80,94.
  7. Hw due Mon Sept 22: 2.2, pg 111: #7,17,24,27,39,54,58,62,72.
  8. Hw due Wed Sept 24: 2.3, pg 121: #8,10,18,20, 76-81, 84-86, 110,112,114, 119.
  9. Hw due Fri Oct 3: 3.1, pg 140: #11,14,19-24,27,30,31,38,40,41,43.
  10. Hw due Wed Oct 8: 3.2, pg 146: #1,5,20,21,29,30,43, 54, 48(bonus).
  11. Hw due Fri Oct 10: 3.3, pg 153: #1,2,5,9,10,13,17,20.
  12. Hw due Wed Oct 15: 4.1, pg 175: #3, 9-12, 39,49,53,54.
  13. Hw due Fri Oct 24: 4.2, pg 188: # 12,13,17,20,22,28,34,35,43,45.
  14. Hw due Wed Oct 29: Numerical sol to discrete dynamical systems
  15. Hw due Nov 7: Problems 1 through 12 from Handout 4 on Counting Process and Classical Combinatorics.
  16. Hw due Nov 12: Problems 13 through 19 from Handout 4 on Counting Process and Classical Combinatorics.
  17. Hw due Nov 17: Problems from graph theory
  18. Hw due Nov 21: Problems from MCST and Euler tours
  19. Hw due Dec 1: Problems from Shortest Path
  20. Hw due Dec 8: Problems from Maximum s-t Flow and Minimum s-t Cut Problems
  21. (If time permits....) Hw due : Problems from Critical Path Methods
  22. Hw due :
    A Lab Hw (will have both computer and written portion). Problems from a selection of different combinatorial optimization models
Please note:
  1. 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 ,
Chair, Division of Science and Mathematics,
Professor of Mathematics & Math Discipline's Web Janitor
Mathematics Discipline
Division of Science and Mathematics
University of Minnesota - Morris
Morris, MN 56267
(320)-589-6301
email: pehng@morris.umn.edu

© 2001-2014 by Peh Ng
Last Modified Sunday, November 30, 2014
Page URL: http://facultypages.morris.umn.edu/~pehng/Ma3411/hw.html

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.