printer friendly pageMATH 62DM: Modern Mathematics: Discrete Methods
This is the second part of a theoretical (proof-based) sequence with a focus on discrete mathematics. The central objects discussed in this course are finite fields. These are beautiful structures in themselves, and very useful in large areas of modern mathematics, and beyond. Our goal will be to construct these, understand their structure, and along the way discuss unexpected applications in combinatorics and number theory. Highlights of the course include a complete proof of a polynomial time algorithm for primality testing, Sidon sets and finite projective planes, and an understanding of a lovely magic trick due to Persi Diaconis. Prerequisite:
Math 61DM or 61CM.
Terms: Win
| Units: 5
| UG Reqs: WAY-FR
Instructors:
Soundararajan, K. (PI)
;
Kuperberg, V. (TA)
MATH 63DM: Modern Mathematics: Discrete Methods
Third part of a proof-based sequence in discrete mathematics, though independent of the second part (62DM). The first half of the quarter gives a brisk-paced coverage of probability and random processes with an intensive use of generating functions and a rich variety of applications. The second half treats entropy, Bayesian inference, Markov chains, game theory, probabilistic methods in solving non-probabilistic problems. We use continuous calculus, e.g. in handling the Gaussian, but anything needed will be reviewed in a self-contained manner. Prerequisite:
Math 61DM or 61CM
Terms: Sum
| Units: 5
| UG Reqs: WAY-FR
Instructors:
Tokieda, T. (PI)
;
Yang, K. (TA)
Filter Results: