Downloaded 19 times
Uploaded byMatthew Leingang
Introduction
This document outlines the goals, topics, grading structure, and contact information for a discrete mathematics course taught by Professor Matthew Leingang in the spring of 2009. The course will cover set theory, algorithms, number theory, probability, recurrence, graph theory, and more. Grades are based on homework, midterms, quizzes, and a final exam. Students are encouraged to ask questions, and the professor and TAs are available to help.
More Related Content
Editor's Notes
- #4 My office is WWH and I’ll soon figure out some office hours. You can e-mail me or I’m also on Facebook if that’s your preference.
- #6 I started in July, but I’ve been around the block a few times. My Ph.D. is from Harvard in 2000, I spent three years at Rutgers, the last five years at Harvard.
- #10 http://flickr.com/photos/riggzy/533010340/sizes/l/
- #11 http://flickr.com/photos/damonabnormal/2920847299/sizes/o/
- #12 http://flickr.com/photos/mpdehaan/72203037/sizes/l/
- #13 http://flickr.com/photos/natman/127097316/sizes/l/
- #14 http://flickr.com/photos/greenem/11696663/sizes/l/
- #16 750 on SAT Math, 4 on AB, 3 on BC, C in V63.0009, or our test.
- #17 Precalculus is not a hoop to be jumped through on the way to calculus (“I already took that”), but a set of essential tools which enable doing the problems of calculus.
- #18 Practice problems: do them, don’t turn them in.
- #19 Graded problems: turn them in. a sample will be graded.
- #20 No late homework! Please keep up.
- #21 Drop the lowest 1 in computation of final grade
- #22 Work together, write up your own work