= Add activity session to your calendar (exports in iCalendar format)
Board Game Night
Benjamin Elias
| Jan/17 | Thu | 06:00PM-11:00PM | 2-290 |
Enrollment: Unlimited: No advance sign-up
Board Game Night, hosted by the Mathematics Department.
Prepare to be aggravated by Agricola, bedraggled by Battlestar Galactica, cowered by Power Grid, dominated at Dominion, dispatched by Die Spiecherstadt. An alphabet of fun.
A library of board games will be available (and you can bring your own). Bring your friends and enemies.
(Cooperative board games will also be available.)
Sponsor(s): Mathematics
Contact: Benjamin Elias, 2-248, 617-253-4993, belias@math.mit.edu
Bridge Tournament
Benjamin Elias
| Jan/16 | Wed | 12:00PM-06:00PM | 2-290 |
Enrollment: Unlimited: No advance sign-up
The Mathematics Department challenges all MIT bridge players to a team-of-four tournament. Those without a full team can still come and hope to find teammates. Refreshments offered, prizes awarded. Come and have a good time.
Sponsor(s): Mathematics
Contact: Benjamin Elias, 2-248, 3-4993, belias@math.mit.edu
Directed Reading Program in Mathematics
Mark Behrens, Paul Seidel
| Date TBD | Time TBD | |||
Enrollment: Limited: Advance sign-up required
Sign-up by 11/16
For undergraduates wanting to learn mathematical topics through guided self-study. Application deadline for Jan 2013 IAP is: FRIDAY, NOVEMBER 16 2012.
For more information and application instructions, see http://math.mit.edu/~drp/
Sponsor(s): Mathematics
Contact: Mark Behrens, mbehrens@math.mit.edu
IAP TUTORIAL: Julia: A Fresh Approach to Technical Computing
Alan Edelman
| Jan/15 | Tue | 10:00AM-03:00PM | 1-115, (pizza lunch), Bring your own laptop with Julia preloaded | |
| Jan/16 | Wed | 10:00AM-01:00PM | 1-115, bring your own laptop |
Enrollment: Email Professor Edelman: (edelman@math.mit.edu) subject julia iap
Attendance: Participants must attend all sessions
Ideal for MATLAB, Python, or R users interested in high performance for science, large data, or
engineering computation.
Julia is a high-level, high-performance dynamic programming language for technical computing, with syntax familiar to users of other technical computing environments. It provides a sophisticated compiler, distributed parallel execution, numerical accuracy, and an extensive mathematical function library. The library, mostly written in Julia itself, also integrates mature, best-of-breed C and Fortran libraries for linear algebra, random number generation, FFTs, and string processing. Julia programs
are organized around defining functions, and overloading them for different combinations of argument types (which can also be user-defined). This IAP laboratory class will teach new users about best practices in the use of Julia.
Professor Alan Edelman
Jeff Bezanson
Stefan Karpinski
Viral Shah
Guest Lecturers from Academia and Industry; MIT and Harvard Students
For more: Google Julia, go to julialang.org, read some of the press or
Why we created Julia?: http://julialang.org/blog/2012/02/why-we-created-julia/
Participation is Limited. Email edelman@math.mit.edu telling us about you. Let us know a bit about your use of MATLAB, Python, R, MPI, Cuda etc. Are you already a little familiar with Julia? (not at all, read or heard a little, already added
1+1, wrote a real program). Invitation will be based on enthusiasm more than experience.
Sponsor(s): Mathematics
Contact: Alan Edelman, 2-343, 3-7770, edelman@math.mit.edu
Integration Bee
Samuel Watson
Enrollment: Unlimited: No advance sign-up
Attendance: Contestants must qualify: see Friday Jan. 11
Prereq: need to pass the qualifying test on 1/11 to enter the bee
See individual session descriptions below.
Sponsor(s): Mathematics
Contact: Samuel Watson, 2-489, 3-4086, samuel.s.watson@gmail.com
| Jan/11 | Fri | 04:00PM-06:00PM | 4-145 |
Stop by at any point during the session, for a quick test of your single variable integration skills. Top scorers qualify for the Integration Bee. No knowledge beyond 18.01 necessary.
http://math.mit.edu/~sswatson/integrationbee.html
| Jan/15 | Tue | 06:30PM-09:00PM | 10-250 |
No enrollment limit. No advance sign up (but contestants must qualify, see Friday, Jan. 11). Come watch your fellow students match wits and single variable integration skills for prizes and the title of "Grand Integrator".
Introduction to Contract Bridge
Jim Rasmussen, Alya Asarina
Enrollment: Unlimited: No advance sign-up
Attendance: Participants requested to attend all sessions (non-series)
Come and discover the fun and intellectual challenge associated with contract bridge!
In this course, we explore the fundamentals of the game, including bidding, declarer
play, and defense. The lessons are based on The Club Series by Audrey Grant,
published by the American Contract Bridge League.
Each session will consist of a lecture, several examples, and supervised play. By the
end of this seven-session course, the student will have learned enough to play bridge
socially, and start exploring the exciting world of duplicate bridge.
There will also be an individual tournament at the end of the course, with prizes for
the winners.
Please bring $10 for a book deposit on the first day of class. We will return your $10
at the end of IAP and you get to keep the book.
Open to any students in the area or MIT affiliates
Sponsor(s): Mathematics
Contact: Alya Asarina, alya@mit.edu
Jim Rasmussen, Alya Asarina
Introduction to Proofs
Eric Baer, Instructor in Pure Mathematics
Enrollment: email (ebaer@math.mit.edu) to save your spot.
Attendance: Participants must attend all sessions
Prereq: Calculus
An introduction to proof techniques and proof-writing.
Students will gain familiarity with mathematical notation and language,
and experience in reading and writing proofs. The course will be
self-contained, and there are no prerequisites beyond Calculus.
Course meetings will be a mixture of lectures, examples, class
discussions, and many opportunities for students to practice writing
proofs. Feedback will be available (both from instructor and peer
discussions).
Sponsor(s): Mathematics
Contact: Eric Baer, 2-376, x 3-5013, ebaer@math.mit.edu
Mathematical Contest in Modeling (MCM)
Adam Elmachtoub, Martin Bazant
| Jan/16 | Wed | 02:00PM-03:30PM | 66-110 | |
| Jan/25 | Fri | 01:00PM-02:30PM | 66-110 |
Enrollment: Unlimited: No advance sign-up
Attendance: Repeating event, particpants welcome at any session
The Mathematical Contest in Modeling is an international competition where teams of three undergraduates come up with ideas to solve real-world problems using mathematical modeling. The format of the competition is that teams have four consecutive days (Jan 31 – Feb 4) to solve and write up a solution to one of three different problems. In each of the sessions, we will discuss an overview of the competition, tips for competing, forming teams, and mathematical tools. Teams should be well-rounded, interdisciplinary, and have members that can model, program, and write well. We will help people form teams at the sessions. We will also select one team to be the local MIT winner of the MCM who will win a grand prize of $300, dinner reception, and the title of MIT MCM winners. All courses/disciplines are welcome! (See link for official rules and previous contests.) This session is not mandatory for participation but encouraged for newcomers.
http://www.comap.com/undergraduate/contests/mcm/
http://web.mit.edu/orc/www/spotlight-MCMcompetition.html
Sponsor(s): Operations Research Center, Mathematics
Contact: Adam Elmachtoub, ane@mit.edu
Mathematics Department Music Recital
Rosalie Belanger-Rioux
| Feb/01 | Fri | 03:00PM-05:00PM | Killian Recital Hall, Rehearsal: Wed. Jan. 30, 2-4pm |
Enrollment: Contact Rosalie Belanger-Rioux (robr@math.mit.edu)
This annual concert gives those in the mathematics community, together with family and friends, a chance to perform for each other. Come to play or listen.
Sponsor(s): Mathematics
Contact: Rosalie Belanger-Rioux, 2-331, 3-5029, robr@math.mit.edu
The Prime Number Theorem
Sigurdur Helgason
| Jan/08 | Tue | 01:00PM-02:30PM | 2-147 | |
| Jan/10 | Thu | 01:00PM-02:30PM | 2-147 |
Enrollment: Unlimited: No advance sign-up
Attendance: Participants must attend all sessions
The location of prime numbers is a central question in number theory. Around 1808, Legendre offered experimental evidence that the number P(x) of primes < x behaves like x/log x for large x. Tchebychev proved (1848) the partial result that the ratio of P(x) to x/log x for large x lies between 7/8 and 9/8. In 1896 Hadamard and de la Vallée Poussin independently proved the Prime Number Theorem that the limit of this ratio is exactly 1. Many distinguished mathematicians (particularly Norbert Wiener) have contributed to a simplification of the proof and now (by an important device by D.J. Newman and an exposition by D. Zagier) a very short and easy proof is available.
These lectures follow Zagier's account of Newman's short proof on the prime number theorem. cf:
1) D.J. Newman, Simple Analytic Proof of the Prime Number Theorem, Amer. Math. Monthly 87 (1980), 693-697.
2) D. Zagier, Newman's short proof of the Prime Number Theorem, Amer. Math. Monthly 104 (1997), 705-708.
Sponsor(s): Mathematics
Contact: Sigurdur Helgason, 2-182, x3-3668, helgason@mit.edu
Contact Information
COPYRIGHT 2012