Thinking and Proving: Topics in Discrete Mathematics
01/24/2011 - 04/29/2011
Thursday 06:00 PM - 08:30 PM
Science Tower 139
This course uses topics from discrete mathematics to illustrate general methods of approaching and solving mathematical problems. We will develop core ideas of discrete mathematics from areas like logic, basic set theory, combinatorics, probability and graph theory. We will use this development to think about the way we solve problems and present our solutions. In this way the course should enhance the ability of students to approach other areas of mathematics as well.
This course is open to auditors.
The deadline to withdraw and receive a tuition refund for this course is Friday, January 28 at 5:00 pm. Please visit our website for a complete list of registration and withdrawal dates for this session.
Adam Fieldsteel (A.B. Brown University; Ph.D. University of California, Berkeley) is professor of mathematics. His research focuses on ergodic theory and topological dynamics, and his recent publications include: (with A. Blokh), "Sets that force recurrence," Proceedings of the American Mathematical Society (2002); (with K. Dajani), "Equipartition of interval partitions and an application to number theory," Proceedings of the American Mathematical Society (2001); (with R. Hasfura), "Dyadic equivalence to completely positive entropy," Transactions of the American Mathematical Society (1998). Click here for more information about Adam Fieldsteel.
Consent of Instructor Required: No
|Level: GLSP||Credits: 3||Enrollment Limit: 18|
Texts to purchase for this course:
D'Angelo, Mathematical Thinking: Problem-Solving and Proofs, 2nd Edition, Prentice Hall
Reading materials are available at BROAD STREET BOOKS, 45 Broad Street, Middletown 860-685-7323 Order your books online.
|Register for Courses|
Contact email@example.com to submit comments or suggestions.
Copyright Wesleyan University, Middletown, Connecticut, 06459