Rev2 has Gone Live
Posted: Sun Nov 5 18:00:10 MST 2006Clicking the Rev2 button in the link strip above will whisk you off to an evolving list of review problems and suggestions for preparations for Test #2, Friday, 11/10/06.
Assignment #11 (Due Monday, 11/6/06)
Posted: Mon Oct 30 11:33:50 MST 2006
Due Date Bumped: Thu Nov 2 19:00:53 MST 2006
Yes, 1.12: Fri Nov 3 05:45:48 MST 2006
- 10.6a and 10.6b
- 1.12 Yes, 1.12
- 12.4
- 14.1
Sociology of Science -- Spring 2007
Posted: Thu Oct 26 14:35:40 MDT 2006Click here for info on a "cross-disciplinary" course.
Assignment #9 Rewrites (Due Monday, 10/30/06)
Posted: Wed Oct 25 14:41:06 MDT 2006You can rewrite any of the first three #9 problems on which your score was less than 22. You can rewrite the last one if your score was less than 7.
Assignment #10 (Due Friday, 10/27/06)
Posted: Fri Oct 20 15:12:16 MDT 2006
- 10.6 (Hint: for this problem you are allowed to use infinite-series results discussed or established in class on Friday, 10/20/06).
- 10.10
- 12.1
Mathematics and Chemistry Colloquium, 1240, 10/19/06, MG 108
Posted: Wed Oct 18 05:54:56 MDT 2006Click here for speaker's webpage.Date: Tue, 17 Oct 2006 16:11:55 -0600 (MDT) From: Justin MooreSubject: math colloquium Colloquium Department of Mathematics Molecular Design Using Chemical Fragments Shawn Martin Sandia National Laboratories Albuquerque, NM Abstract I will describe a mathematical framework developed for the design of molecular structures with desired properties. This method uses fragments of molecular graphs to predict chemical properties. Linear Diophantine equations with inequality constraints are then used to re-organize the fragments into novel molecular structures. The method has been previously applied to problems in drug and materials design, including LFA-1/ICAM-1 inhibitory peptides, linear homopolymers, and hydrofluoroether foam blowing agents. I will provide a complete description of the method, including a new approach to overcome previous limitations due to combinatorial complexity. The new approach uses the Fincke-Pohst algorithm for lattice enumeration, implemented using the PARI/GP computer algebra library. Thursday, October 19 12:40 pm Room: MG 108 Refreshments: 1:40 pm in MG226. All interested persons are welcome. The talk will be accessible to upper division students.
Assignment #9 (Due Friday, 10/20/06)
Posted: Fri Oct 13 07:05:27 MDT 2006
- 9.12(a)
- 10.7
- 11.9
Assignment #8 (Due Monday, 10/16/06)
Posted: Fri Oct 13 07:00:42 MDT 2006
- 11.3
Assignment #7 (Due Friday, 10/6/06)
Posted: Mon Oct 2 11:11:47 MDT 2006
- 9.4, 9.5
- 9.11
- 9.16a -- Rather than follow the text directions, put together a "falling-chain" proof using definition 9.8.
Boise State University is not responsible for all information accessible from this web page. Links to the rest of the Internet point to material maintained by many other people and organizations.